Embedding 3-polytopes on a small grid

DOI10.1145/1247069.1247086zbMATH Open1221.05091OpenAlexW2011660002MaRDI QIDQ3602860FDOQ3602860

Authors: Ares Ribó Mor, Günter Rote, André Schulz 

Publication date: 12 February 2009

Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1247069.1247086

Recommendations

• Small grid embeddings of 3-polytopes
• Drawing 3-polytopes with good vertex resolution
• Drawing 3-polytopes with good vertex resolution

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (12)

• Discrete trace theorems and energy minimizing spring embeddings of planar graphs
• Realizing planar graphs as convex polytopes
• A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
• Small grid embeddings of 3-polytopes
• Embeddings of small generalized polygons
• Resolving Loads with Positive Interior Stresses
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
• Skyscraper polytopes and realizations of plane triangulations
• Tutte embeddings of tetrahedral meshes
• Drawing 3-polytopes with good vertex resolution
• Drawing 3-polytopes with good vertex resolution
• A duality transform for constructing small grid embeddings of 3d polytopes

This page was built for publication: Embedding 3-polytopes on a small grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602860)