A duality transform for constructing small grid embeddings of 3d polytopes
From MaRDI portal
Publication:679743
DOI10.1016/j.comgeo.2016.03.004zbMath1381.52017arXiv1402.1660OpenAlexW1946180610MaRDI QIDQ679743
Alexander Igamberdiev, André Schulz
Publication date: 19 January 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.1660
graph drawingconvex polytopesdual polytopelattice polytopesgraph representation3D polytopesgrid embeddinginteger realization
Three-dimensional polytopes (52B10) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)
Cites Work
- Small grid embeddings of 3-polytopes
- How to draw a planar graph on a grid
- Strictly convex drawings of planar graphs
- A paradigm for robust geometric algorithms
- A quantitative Steinitz' theorem
- 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
- On the Number of Spanning Trees a Planar Graph Can Have
- An Asymptotic Expression for the Number of Solutions of a General Class of Diophantine Equations
- Drawing 3-Polytopes with Good Vertex Resolution