Approximate Range Searching: The Absolute Model

DOI10.1007/978-3-540-73951-7_2MaRDI QIDQ3603509zbMATH OpenOpenAlexFDO

Authors Guilherme D. Da Fonseca

Publication date 17 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1903/7037

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximate range searching: The absolute model
• Approximate range searching
• Approximate range searching in higher dimension
• A dynamic data structure for approximate range searching
• Approximate range searching using binary space partitions
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Fully retroactive approximate range and nearest neighbor searching
• Approximate range closest-pair queries
• Approximate Range Searching in External Memory
• Approximate range searching in external memory

Cited in

(6)

• The effect of corners on the complexity of approximate range searching
• Approximate input sensitive algorithms for point pattern matching
• Relative (p, )-approximations in geometry
• Approximate range searching: The absolute model
• On the importance of idempotence
• Approximate range searching

This page was built for publication: Approximate Range Searching: The Absolute Model

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