Linear-time algorithms for hole-free rectilinear proportional contact graph representations

DOI10.1007/S00453-013-9764-5MaRDI QIDQ378246zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cartogramplanar graphgraph drawingpolygoncontact representation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

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

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 4185629 (Why is no real title available?)
• scientific article; zbMATH DE number 3027510 (Why is no real title available?)
• Compact floor-planning via orderly spanning trees
• Computing cartograms with optimal complexity
• Drawing planar 3-trees with given face areas
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Floorplanning by graph dualization: \(L\)-shaped modules
• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
• Minimum-area drawings of plane 3-trees
• Octagonal drawings of plane graphs with prescribed face areas
• On Diagrams Representing Maps
• On Floor-Plan of Plane Graphs
• On Triangle Contact Graphs
• On rectangular cartograms
• On rectilinear duals for vertex-weighted plane graphs
• On topological aspects of orientations
• Orthogonal Drawings for Plane Graphs with Specified Face Areas
• Orthogonal cartograms with few corners per face
• Plane Cubic Graphs with Prescribed Face Areas
• Rectangular duals of planar graphs
• Rectangular layouts and contact graphs

Cited in

(11)

• Rectilinear duals using monotone staircase polygons
• Area-universal drawings of biconnected outerplane graphs
• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
• Constrained floorplans in 2D and 3D
• Order-preserving 1-string representations of planar graphs
• Improved approximation algorithms for box contact representations
• Edge-weighted contact representations of planar graphs
• Orthogonal cartograms with at most 12 corners per face
• Proportional contact representations of planar graphs
• Proportional contact representations of 4-connected planar graphs
• Edge-weighted contact representations of planar graphs

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)