Proximate point searching

DOI10.1016/J.COMGEO.2004.01.005zbMATH Open1140.68509OpenAlexW2162649143MaRDI QIDQ598552FDOQ598552

Stefan Langerman, John Iacono, Erik D. Demaine

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

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

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)

Cites Work

• Title not available (Why is that?)
• Self-adjusting binary search trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Entropy-preserving cuttings and space-efficient planar point location
• A simple entropy-based algorithm for planar point location
• Optimum binary search trees
• Design and Analysis of a Data Structure for Representing Sorted Lists
• Title not available (Why is that?)
• The pairing heap: A new form of self-adjusting heap
• Alternatives to splay trees with \(O(\log n)\) worst-case access times
• 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
• Proximate planar point location
• Title not available (Why is that?)

Cited In (8)

• Proximity Search with a Triangulated Spatial Model
• Indexing moving points
• Proximate planar point location
• Local properties of geometric graphs
• Practical distribution-sensitive point location in triangulations
• Searching and storing similar lists
• A History of Distribution-Sensitive Data Structures
• Filtering Search: A New Approach to Query-Answering

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)