On rectangular cartograms

DOI10.1016/J.COMGEO.2006.06.002MaRDI QIDQ883236zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Bettina Speckmann, Marc 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

zbMATH Keywords

cartogramrectangular layout

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Algorithms – ESA 2004
• Optimal BSPs and rectilinear cartograms
• Table cartogram
• Computing cartograms with optimal complexity
• Computing cartograms with optimal complexity

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• A combinatorial approach to cartograms.
• 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 Drawing
• Graph-Theoretic Concepts in Computer Science
• Rectangular duals of planar graphs
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Cited in

(27)

• Algorithms – ESA 2004
• Computing cartograms with optimal complexity
• Fixed-energy harmonic functions
• Area-universal and constrained rectangular layouts
• Orientation-Constrained Rectangular Layouts
• Aspect ratio universal rectangular layouts
• Computing stable Demers cartograms
• Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
• Layered area-proportional rectangle contact representations
• Aspect ratio universal rectangular layouts
• Linear-time algorithms for hole-free rectilinear proportional contact graph representations
• Morphing rectangular duals
• On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
• Octagonal drawings of plane graphs with prescribed face areas
• Table cartogram
• Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
• On rectilinear duals for vertex-weighted plane graphs
• RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY
• Combinatorial generation via permutation languages. III: Rectangulations
• Extending partial representations of rectangular duals with given contact orientations
• Orthogonal cartograms with at most 12 corners per face
• Proportional contact representations of planar graphs
• Table cartograms
• Fitting planar graphs on planar maps
• Optimal BSPs and rectilinear cartograms
• A combinatorial approach to cartograms.
• Computing cartograms with optimal complexity

Describes a project that uses

Uses Software

• CartoDraw

This page was built for publication: On rectangular cartograms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883236)