Two algorithms for finding rectangular duals of planar graphs

DOI10.1007/3-540-57899-4_69zbMath1530.05179MaRDI QIDQ6184635

Goos Kant, Xin He

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/15915

zbMATH Keywords

linear-time algorithmsregular edge labeling4-connected planar triangular graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Planar L-Drawings of Bimodal Graphs ⋮ Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Realization and connectivity of the graphs of origami flat foldings ⋮ Planar L-Drawings of Bimodal Graphs

Cites Work

• How to draw a planar graph on a grid
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Algorithms for drawing graphs: An annotated bibliography
• Rectangular duals of planar graphs
• A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Two algorithms for finding rectangular duals of planar graphs