Rectangular duals of planar graphs

DOI10.1002/net.3230150202zbMath0585.05029OpenAlexW2018046116MaRDI QIDQ3710557

Krzysztof A. Kozminski, Edwin Kinnen

Publication date: 1985

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230150202

zbMATH Keywords

algorithmVLSI designcuberectangles4- triangulationrectangular dual of a plane graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (42)

On orthogonally convex drawings of plane graphs ⋮ Planar L-Drawings of Bimodal Graphs ⋮ Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ An efficient parallel algorithm for finding rectangular duals of plane triangular graphs ⋮ A linear algorithm to find a rectangular dual of a planar triangulated graph ⋮ Orientation-Constrained Rectangular Layouts ⋮ Aspect ratio universal rectangular layouts ⋮ RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY ⋮ On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs ⋮ Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Rectilinear Duals Using Monotone Staircase Polygons ⋮ On rectangular cartograms ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Star Shaped Orthogonal Drawing ⋮ Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems ⋮ Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames ⋮ Constrained floorplans in 2D and 3D ⋮ Improved floor-planning of graphs via adjacency-preserving transformations ⋮ Morphing rectangular duals ⋮ An annotated review on graph drawing and its applications ⋮ Two algorithms for finding rectangular duals of planar graphs ⋮ Extending partial representations of rectangular duals with given contact orientations ⋮ Star-Shaped and L-Shaped Orthogonal Drawings ⋮ Transformations among rectangular partitions ⋮ Complexity Measures for Mosaic Drawings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computing cartograms with optimal complexity ⋮ A theory of rectangular dual graphs ⋮ Realization and connectivity of the graphs of origami flat foldings ⋮ On the bend-number of planar and outerplanar graphs ⋮ 8k-ary Grid Graph Models of Tabular Forms ⋮ Rectangular-radial drawings of cubic plane graphs ⋮ On triangulating planar graphs under the four-connectivity constraint ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Simple and efficient floor-planning ⋮ On rectilinear duals for vertex-weighted plane graphs ⋮ Proportional Contact Representations of Planar Graphs ⋮ ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS ⋮ Planar L-Drawings of Bimodal Graphs ⋮ Floorplanning by graph dualization: \(L\)-shaped modules ⋮ A theory of L-shaped floor-plans

This page was built for publication: Rectangular duals of planar graphs