Constructions and complexity of secondary polytopes
Publication:750909
DOI10.1016/0001-8708(90)90077-ZzbMath0714.52004OpenAlexW2064838814MaRDI QIDQ750909
Bernd Sturmfels, Paul Filliman, Billera, Louis J.
Publication date: 1990
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(90)90077-z
computational complexitycomputational geometryregular triangulationssecondary polytopeGale transforms
Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other designs, configurations (05B30) Gale and other diagrams (52B35)
Related Items (66)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neighborly polytopes and oriented matroids
- Exterior algebra and projection of polytopes
- Decomposability of polytopes and polyhedra
- The associahedron and triangulations of the \(n\)-gon
- Triangulations of Oriented Matroids and Convex Polytopes
- Some Applications of Affine Gale Diagrams to Polytopes with Few Vertices
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- THE GEOMETRY OF TORIC VARIETIES
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Lawrence Polytopes
- Homotopy Associativity of H-Spaces. I
- Partition of Space
This page was built for publication: Constructions and complexity of secondary polytopes