Small grid embeddings of 3-polytopes
From MaRDI portal
Publication:629826
DOI10.1007/s00454-010-9301-0zbMath1210.68077arXiv0908.0488OpenAlexW1512554268MaRDI QIDQ629826
Günter Rote, André Schulz, Ares Ribó Mor
Publication date: 10 March 2011
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.0488
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
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, Realizing Planar Graphs as Convex Polytopes, A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing, A duality transform for constructing small grid embeddings of 3d polytopes, Convexity-increasing morphs of planar graphs, Rational realization of the minimum ranks of nonnegative sign pattern matrices, Liftings and stresses for planar periodic frameworks
Cites Work
- How to draw a planar graph on a grid
- Strictly convex drawings of planar graphs
- Convex drawings of 3-connected plane graphs
- Matrix multiplication via arithmetic progressions
- A generalization of the matrix-tree theorem
- Existence and uniqueness of packings with specified combinatorics
- A paradigm for robust geometric algorithms
- 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
- Straightening polygonal arcs and convexifying polygonal cycles
- Realization spaces of polytopes
- Discrete one-forms on meshes and applications to 3D mesh parameterization
- Convex Representations of Graphs
- On the Number of Spanning Trees a Planar Graph Can Have
- Embedding 3-polytopes on a small grid
- An Asymptotic Expression for the Number of Solutions of a General Class of Diophantine Equations
- Generalized Nested Dissection
- Applications of a Planar Separator Theorem
- Realization spaces of 4-polytopes are universal
- How to Draw a Graph
- Drawing 3-Polytopes with Good Vertex Resolution
- Matrix theory. Basic results and techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
