On approximate halfspace range counting and relative epsilon-approximations

DOI10.1145/1247069.1247128MaRDI QIDQ3602891zbMATH OpenOpenAlexFDO

Authors Boris Aronov, Sariel Har-Peled, 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) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Euclidean geometries (general) and generalizations (51M05)

Recommendations

• Relative (p, )-approximations in geometry
• Approximate range searching
• Approximate halfspace range counting
• On approximate range counting and depth
• On approximate range counting and depth

Cited in

(11)

• Approximations and optimal geometric divide-and-conquer
• Range minima queries with respect to a random permutation, and approximate range counting
• Approximate range searching: The absolute model
• The overlay of minimization diagrams in a randomized incremental construction
• Relative \((p,\varepsilon )\)-approximations in geometry
• Approximate halfspace range counting
• On approximate range counting and depth
• On Dominance Reporting in 3D
• Algorithms for ε-Approximations of Terrains
• Minimum-link paths revisited
• On approximate range counting and depth

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

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