Embedding stacked polytopes on a polynomial-size grid

DOI10.1007/s00454-017-9887-6zbMath1372.52019arXiv1403.7980OpenAlexW3137065090MaRDI QIDQ2358818

Erik D. Demaine, André Schulz

Publication date: 16 June 2017

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.7980

zbMATH Keywords

liftingsinteger realizationstacked polytopesgrid size

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Embedding stacked polytopes on a polynomial-size grid, From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs, Skyscraper polytopes and realizations of plane triangulations, Embedding Plane 3-Trees in ℝ2 and ℝ3, Realizing Planar Graphs as Convex Polytopes, On ill-conceived initialization in archetypal analysis, A duality transform for constructing small grid embeddings of 3d polytopes, Plane 3-Trees: Embeddability and Approximation, A combinatorial algorithm to construct 3D isothetic covers

Cites Work

• Unnamed Item
• Small grid embeddings of 3-polytopes
• Strictly convex drawings of planar graphs
• Triangulations. Structures for algorithms and applications
• Existence and uniqueness of packings with specified combinatorics
• A paradigm for robust geometric algorithms
• Stresses and liftings of cell-complexes
• A quantitative Steinitz' theorem
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• Steinitz representations of polyhedra and the Colin de Verdière number
• Embedding stacked polytopes on a polynomial-size grid
• Realization spaces of polytopes
• A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
• Minimum-Area Drawings of Plane 3-Trees
• Convex Representations of Graphs
• On the Number of Spanning Trees a Planar Graph Can Have
• Lectures on Polytopes
• Realization spaces of 4-polytopes are universal
• How to Draw a Graph
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
• Drawing 3-Polytopes with Good Vertex Resolution