On simplifying dot maps.

DOI10.1016/J.COMGEO.2003.07.005MaRDI QIDQ1421029zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Pat Morin, Mark de Berg, Otfried Cheong

Publication date 23 January 2004

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2003.07.005

zbMATH Keywords

visualizationnumerical examplesalgorithmdiscrepancydensity function\(\varepsilon\)-approximationsdot maps

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Algorithms for ε-Approximations of Terrains
• Simplifying massive planar subdivisions
• Algorithmic aspects of proportional symbol maps
• Algorithmic Aspects of Proportional Symbol Maps
• Consistent thinning of large geographical data for map visualization

Cites work

• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 1182924 (Why is no real title available?)
• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• Algorithmics for hard problems.
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• Efficient and small representation of line arrangements with applications
• New Upper Bounds in Klee’s Measure Problem
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Translating a regular grid over a point set

Cited in

(2)

• Dense Glyph Sampling for Visualization
• scientific article; zbMATH DE number 5912556 (Why is no real title available?)

This page was built for publication: On simplifying dot maps.

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