On rectilinear duals for vertex-weighted plane graphs

DOI10.1016/j.disc.2007.12.087zbMath1182.05121OpenAlexW2138620696WikidataQ59782336 ScholiaQ59782336MaRDI QIDQ1011760

Bettina Speckmann, Elena Mumford, Mark T. de Berg

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.087

zbMATH Keywords

cartogramrectilinear layout

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) 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 (11)

Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Optimal polygonal representation of planar graphs ⋮ Table cartogram ⋮ Complexity Measures for Mosaic Drawings ⋮ Unnamed Item ⋮ Computing cartograms with optimal complexity ⋮ On the area-universality of triangulations ⋮ OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS ⋮ On Area-Universal Quadrangulations

Cites Work

• On rectangular cartograms
• On the optimal binary plane partition for sets of isothetic rectangles
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
• Rectangular duals of planar graphs
• A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
• Plane Cubic Graphs with Prescribed Face Areas
• Compact floor-planning via orderly spanning trees
• Sliceable Floorplanning by Graph Dualization
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: On rectilinear duals for vertex-weighted plane graphs