Computing cartograms with optimal complexity
From MaRDI portal
Publication:5891266
DOI10.1007/s00454-013-9521-1zbMath1275.68110WikidataQ56689777 ScholiaQ56689777MaRDI QIDQ5891266
Stephen G. Kobourov, Michael Kaufmann, Torsten Ueckerdt, Stefan Felsner, Md. Jawaherul Alam, Therese C. Biedl
Publication date: 6 November 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9521-1
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY, Homothetic triangle representations of planar graphs, Proportional Contact Representations of Planar Graphs, On Area-Universal Quadrangulations, Unnamed Item, Area-universal drawings of biconnected outerplane graphs, Orthogonal cartograms with at most 12 corners per face, Constrained floorplans in 2D and 3D, Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach, On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps, Table cartogram, On the area-universality of triangulations, A theory of L-shaped floor-plans, Computing stable Demers cartograms, Homotopy height, grid-major height and graph-drawing height, On orthogonally convex drawings of plane graphs, Rectilinear Duals Using Monotone Staircase Polygons, Complexity Measures for Mosaic Drawings, Drawing Planar Graphs with Prescribed Face Areas, A New Approach for Contact Graph Representations and Its Applications
Cites Work
- Unnamed Item
- A linear-time algorithm for drawing a planar graph on a grid
- How to draw a planar graph on a grid
- On rectangular cartograms
- On rectilinear duals for vertex-weighted plane graphs
- Optimal polygonal representation of planar graphs
- Area-Universal and Constrained Rectangular Layouts
- Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations
- OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS
- Rectangular duals of planar graphs
- Floorplans, planar graphs, and layouts
- Optimal module sizing in VLSI floorplanning by nonlinear programming
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- On Floor-Plan of Plane Graphs
- On Triangle Contact Graphs
- Compact floor-planning via orderly spanning trees
- Proportional Contact Representations of 4-Connected Planar Graphs
- Edge-Weighted Contact Representations of Planar Graphs
- 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
- Proportional Contact Representations of Planar Graphs
- On topological aspects of orientations
