Proximate point searching

DOI10.1016/J.COMGEO.2004.01.005MaRDI QIDQ598552zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, John Iacono, Stefan Langerman

Publication date 6 August 2004

Published in Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

Distance functionsDynamic finger propertyPoint location

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Best proximity points: approximation and optimization
• A unified approach to approximate proximity searching
• Closest point search in lattices
• On the proximal point algorithm
• The proximal distance algorithm
• The proximal point algorithm in metric spaces
• Best proximity points: Global optimal approximate solutions
• Fixed-radius near neighbors search algorithms for points and segments
• Proximity Search with a Triangulated Spatial Model
• Fixed-radius near neighbors search

Cites work

• scientific article; zbMATH DE number 1617246 (Why is no real title available?)
• scientific article; zbMATH DE number 437552 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• scientific article; zbMATH DE number 742983 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 6472654 (Why is no real title available?)
• A simple entropy-based algorithm for planar point location
• Alternatives to splay trees with \(O(\log n)\) worst-case access times
• Design and Analysis of a Data Structure for Representing Sorted Lists
• Entropy-preserving cuttings and space-efficient planar point location
• On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
• On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
• Optimum binary search trees
• Proximate planar point location
• Self-adjusting binary search trees
• The pairing heap: A new form of self-adjusting heap

Cited in

(13)

• Searching for the closest-pair in a query translate
• Range search on tuples of points
• Local properties of geometric graphs
• Proximate planar point location
• Indexing moving points
• Optimal parallel algorithms for proximate points, with applications (extended abstract)
• Space exploration via proximity search
• Proximity Search with a Triangulated Spatial Model
• Practical distribution-sensitive point location in triangulations
• Searching and storing similar lists
• Space exploration via proximity search
• Filtering Search: A New Approach to Query-Answering
• A history of distribution-sensitive data structures

This page was built for publication: Proximate point searching

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