Linear-time algorithms for hole-free rectilinear proportional contact graph representations
From MaRDI portal
Publication:378246
DOI10.1007/s00453-013-9764-5zbMath1275.05037OpenAlexW2024283988MaRDI QIDQ378246
Publication date: 11 November 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9764-5
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Rectilinear Duals Using Monotone Staircase Polygons ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ Constrained floorplans in 2D and 3D ⋮ Order-Preserving 1-String Representations of Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rectangular cartograms
- Octagonal drawings of plane graphs with prescribed face areas
- On rectilinear duals for vertex-weighted plane graphs
- Floorplanning by graph dualization: \(L\)-shaped modules
- Drawing planar 3-trees with given face areas
- Optimal polygonal representation of planar graphs
- Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations
- Minimum-Area Drawings of Plane 3-Trees
- Rectangular duals of planar graphs
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- On Floor-Plan of Plane Graphs
- Plane Cubic Graphs with Prescribed Face Areas
- On Triangle Contact Graphs
- Compact floor-planning via orderly spanning trees
- Rectangular layouts and contact graphs
- Orthogonal Cartograms with Few Corners Per Face
- Orthogonal Drawings for Plane Graphs with Specified Face Areas
- On Diagrams Representing Maps
- Computing cartograms with optimal complexity
- On topological aspects of orientations
This page was built for publication: Linear-time algorithms for hole-free rectilinear proportional contact graph representations
