On rectangular cartograms
From MaRDI portal
Publication:883236
DOI10.1016/j.comgeo.2006.06.002zbMath1118.68172OpenAlexW2148987114WikidataQ59782381 ScholiaQ59782381MaRDI QIDQ883236
Bettina Speckmann, Marc J. van Kreveld
Publication date: 4 June 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.06.002
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (20)
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Orientation-Constrained Rectangular Layouts ⋮ Layered area-proportional rectangle contact representations ⋮ Aspect ratio universal rectangular layouts ⋮ Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach ⋮ RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY ⋮ 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 ⋮ Morphing rectangular duals ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Table cartogram ⋮ Extending partial representations of rectangular duals with given contact orientations ⋮ Computing stable Demers cartograms ⋮ Computing cartograms with optimal complexity ⋮ Fixed-energy harmonic functions ⋮ OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS ⋮ Octagonal drawings of plane graphs with prescribed face areas ⋮ On rectilinear duals for vertex-weighted plane graphs ⋮ Proportional Contact Representations of Planar Graphs
Uses Software
Cites Work
- Unnamed Item
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- A combinatorial approach to cartograms.
- Rectangular duals of planar graphs
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
- Compact floor-planning via orderly spanning trees
- Diffusion-based method for producing density-equalizing maps
- Graph-Theoretic Concepts in Computer Science
- Graph Drawing
This page was built for publication: On rectangular cartograms