An efficient orthogonal grid drawing algorithm for cubic graphs

DOI10.1007/bfb0030817zbMath1527.68156OpenAlexW1601492549MaRDI QIDQ6064011

Tiziana Calamoneri, Rossella Petreschi

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030817

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

\((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• At most single-bend embeddings of cubic graphs
• Drawing planar graphs using the canonical ordering
• Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
• Wide-Angle Pair Production and Quantum Electrodynamics at Small Distances

This page was built for publication: An efficient orthogonal grid drawing algorithm for cubic graphs