On simplifying dot maps.

DOI10.1016/j.comgeo.2003.07.005zbMath1041.65023OpenAlexW2099217816MaRDI QIDQ1421029

Prosenjit Bose, Pat Morin, Mark T. de Berg, Otfried Schwarzkopf

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

algorithmvisualizationnumerical examplesdiscrepancydensity function\(\varepsilon\)-approximationsdot maps

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmics for hard problems.
• Translating a regular grid over a point set
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• New Upper Bounds in Klee’s Measure Problem
• Efficient and small representation of line arrangements with applications
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

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