An efficient orthogonal grid drawing algorithm for cubic graphs

DOI10.1007/BFB0030817MaRDI QIDQ6064011zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Algorithms for area-efficient orthogonal drawing
• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
• scientific article; zbMATH DE number 2080108
• Orthogonally drawing cubic graphs in parallel
• Three-dimensional orthogonal graph drawing algorithms

Cites work

• At most single-bend embeddings of cubic graphs
• Drawing planar graphs using the canonical ordering
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• 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

Cited in

(4)

• Algorithms for area-efficient orthogonal drawing
• \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
• Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
• Graph Drawing

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

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