Two algorithms for finding rectangular duals of planar graphs

DOI10.1007/3-540-57899-4_69MaRDI QIDQ6184635zbMATH OpenFDO

Authors 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

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

Recommendations

• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Rectangular duals of planar graphs
• Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
• A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 1256645 (Why is no real title available?)
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
• A unified approach to visibility representations of planar graphs
• Algorithms for drawing graphs: An annotated bibliography
• How to draw a planar graph on a grid
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Rectangular duals of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs

Cited in

(7)

• Planar L-Drawings of Bimodal Graphs
• Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
• Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
• Planar L-drawings of bimodal graphs
• Realization and connectivity of the graphs of origami flat foldings
• RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY
• Efficient enumeration of transversal edge-partitions

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

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