A combinatorial approach to cartograms.

DOI10.1016/S0925-7721(96)00006-5MaRDI QIDQ2482893zbMATHFDO

Authors Roman Waupotitsch, Herbert Edelsbrunner

Publication date 25 April 2008

Published in Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsSingular value decompositionTreesArraysSimplicial mapsCombinatorial topologyHomeomorphismsRange search

Mathematics Subject Classification ID

Designs and configurations (05B99)

Recommendations

• Table cartogram
• On rectangular cartograms
• Diffusion-based method for producing density-equalizing maps
• Algorithms – ESA 2004
• Table cartograms

Cited in

(8)

• On rectangular cartograms
• Fast flow-based algorithm for creating density-equalizing map projections
• Density-equalizing maps for simply connected open surfaces
• On the diffusion algorithm for density-equalizing maps with piecewise constant initial data
• Computing stable Demers cartograms
• Table cartogram
• Diffusion-based method for producing density-equalizing maps
• Optimal BSPs and rectilinear cartograms

This page was built for publication: A combinatorial approach to cartograms.

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