Linear-time algorithms for hole-free rectilinear proportional contact graph representations
DOI10.1007/S00453-013-9764-5zbMATH Open1275.05037OpenAlexW2024283988MaRDI QIDQ378246FDOQ378246
Authors: M. Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov 
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
Recommendations
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- Proportional Contact Representations of Planar Graphs
- Proportional contact representations of planar graphs
- Proportional contact representations of 4-connected planar graphs
- Edge-weighted contact representations of planar graphs
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- On Floor-Plan of Plane Graphs
- Compact floor-planning via orderly spanning trees
- Title not available (Why is that?)
- Optimal polygonal representation of planar graphs
- On Triangle Contact Graphs
- 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
- 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
- Plane Cubic Graphs with Prescribed Face Areas
- Rectangular layouts and contact graphs
- Orthogonal cartograms with few corners per face
- Orthogonal Drawings for Plane Graphs with Specified Face Areas
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Diagrams Representing Maps
- Computing cartograms with optimal complexity
- On topological aspects of orientations
- On rectangular cartograms
Cited In (12)
- Order-preserving 1-string representations of planar graphs
- Optimal polygonal representation of planar graphs
- Rectilinear duals using monotone staircase polygons
- Edge-weighted contact representations of planar graphs
- Constrained floorplans in 2D and 3D
- Proportional contact representations of planar graphs
- Proportional contact representations of 4-connected planar graphs
- Area-universal drawings of biconnected outerplane graphs
- Edge-weighted contact representations of planar graphs
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- Improved approximation algorithms for box contact representations
- Orthogonal cartograms with at most 12 corners per face
This page was built for publication: Linear-time algorithms for hole-free rectilinear proportional contact graph representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378246)
