Drawing 3-polytopes with good vertex resolution

DOI10.7155/JGAA.00216MaRDI QIDQ5894995zbMATH OpenOpenAlexFDO

Authors André Schulz

Publication date 19 April 2011

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/227831

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Drawing 3-polytopes with good vertex resolution
• Embedding 3-polytopes on a small grid
• Small grid embeddings of 3-polytopes
• Point set embedding in 3D

Cited in

(8)

• Skyscraper polytopes and realizations of plane triangulations
• Embedding 3-polytopes on a small grid
• A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
• Graph Drawing via Gradient Descent, (GD)^2
• Drawing 3-polytopes with good vertex resolution
• Small grid embeddings of 3-polytopes
• A duality transform for constructing small grid embeddings of 3d polytopes
• From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs

This page was built for publication: Drawing 3-polytopes with good vertex resolution

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