The shape of orthogonal cycles in three dimensions

DOI10.1007/s00454-011-9381-5zbMath1238.68106OpenAlexW2025920119WikidataQ62042472 ScholiaQ62042472MaRDI QIDQ411405

Giuseppe Liotta, Anna Lubiw, Ethan Kim, Giuseppe Di Battista, S. H. Whitesides

Publication date: 4 April 2012

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

Full work available at URL: https://doi.org/10.1007/s00454-011-9381-5

zbMATH Keywords

cyclesgraph drawing3D orthogonal drawingtopology-shape-metrics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

HV-planarity: algorithms and complexity ⋮ Polygons with Prescribed Angles in 2D and 3D ⋮ Polygons with Prescribed Angles in 2D and 3D

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity results for three-dimensional orthogonal graph drawing
• New results on drawing angle graphs
• Embedding problems for paths with direction constrained edges.
• A note on 3D orthogonal drawings with direction constrained edges
• Rectilinear Graphs and Their Embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Angles of Planar Triangular Graphs

This page was built for publication: The shape of orthogonal cycles in three dimensions