On approximate halfspace range counting and relative epsilon-approximations

DOI10.1145/1247069.1247128zbMath1221.51026OpenAlexW2141487143MaRDI QIDQ3602891

Sariel Har-Peled, Boris Aronov, Micha Sharir

Publication date: 12 February 2009

Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1247069.1247128

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62) Euclidean geometries (general) and generalizations (51M05)

Related Items (6)

Range minima queries with respect to a random permutation, and approximate range counting ⋮ The overlay of minimization diagrams in a randomized incremental construction ⋮ Minimum-link paths revisited ⋮ On Dominance Reporting in 3D ⋮ On approximate range counting and depth ⋮ Approximate range searching: The absolute model

This page was built for publication: On approximate halfspace range counting and relative epsilon-approximations