INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS

DOI10.1142/S0218195906002026zbMath1097.65038MaRDI QIDQ5470176

Hiroki Haga, Kazuyuki Miura, Takao Nishizeki

Publication date: 29 May 2006

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmperfect matching problemGraph and rectangular drawinginner rectangular drawing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (8)

Orthogonal layout with optimal face complexity ⋮ On orthogonally convex drawings of plane graphs ⋮ Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames ⋮ Unit-length rectangular drawings of graphs ⋮ An annotated review on graph drawing and its applications ⋮ Rectangular-radial drawings of cubic plane graphs ⋮ Spherical-Rectangular Drawings ⋮ A theory of L-shaped floor-plans

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of rectangular dual graphs
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Floorplanning by graph dualization: \(L\)-shaped modules
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Rectangular grid drawings of plane graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Network Flow and Testing Graph Connectivity
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Flow in Planar Graphs with Multiple Sources and Sinks
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• A Short Proof of the Factor Theorem for Finite Graphs
• Rectangular drawings of plane graphs without designated corners

This page was built for publication: INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS