Flexible cross-polytopes in the Euclidean 4-space.
Stachel, Hellmuth (2000)
Journal for Geometry and Graphics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Triangulations of integral polytopes and Ehrhart polynomials.”
Flexible cross-polytopes in the Euclidean 4-space.
Separation in the polytope algebra.
McMullen, Peter (1993)
Beiträge zur Algebra und Geometrie
Similarity:
Two Poset Polytopes.
R.P. Stanley (1986)
Discrete & computational geometry
Similarity:
A Note on Small Linear-Ordering Polytopes.
G. Reinelt (1993)
Discrete & computational geometry
Similarity:
Exterior Algebra and Projections of Polytopes.
P. Filliman (1990)
Discrete & computational geometry
Similarity:
The Cubical d-Polytopes with Fewer than 2d+1 Vertices.
R. Blind, G. Blind (1995)
Discrete & computational geometry
Similarity:
On simple polytopes.
Peter McMullen (1993)
Inventiones mathematicae
Similarity:
Flag vectors of multiplicial polytopes.
Bayer, Margaret M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a certain class of polytopes associated with independence systems.
A.B. Hansen (1977)
Mathematica Scandinavica
Similarity:
Largest j-Simplices in n-Polytopes.
V. Klee, P. Gritzmann, D. Larman (1995)
Discrete & computational geometry
Similarity:
Rigidity and flexibility of virtual polytopes
G. Panina (2003)
Open Mathematics
Similarity:
All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual polytope.