A combinatorial approach to cartograms.

DOI10.1016/S0925-7721(96)00006-5zbMATH Open1133.05304MaRDI QIDQ2482893FDOQ2482893

Authors: Roman Waupotitsch, Herbert Edelsbrunner 

Publication date: 25 April 2008

Published in: Computational Geometry (Search for Journal in Brave)

Recommendations

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

zbMATH Keywords

AlgorithmsSingular value decompositionTreesArraysSimplicial mapsCombinatorial topologyHomeomorphismsRange search

Mathematics Subject Classification ID

Designs and configurations (05B99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• On rectangular cartograms
• On the diffusion algorithm for density-equalizing maps with piecewise constant initial data
• Optimal BSPs and rectilinear cartograms
• Diffusion-based method for producing density-equalizing maps
• Density-Equalizing Maps for Simply Connected Open Surfaces
• Table cartogram
• Computing stable Demers 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)