Proximate point searching
From MaRDI portal
Publication:598552
DOI10.1016/j.comgeo.2004.01.005zbMath1140.68509OpenAlexW2162649143MaRDI QIDQ598552
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
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Practical distribution-sensitive point location in triangulations, Local properties of geometric graphs, A History of Distribution-Sensitive Data Structures
Cites Work
- The pairing heap: A new form of self-adjusting heap
- Optimum binary search trees
- Self-adjusting binary search trees
- Design and Analysis of a Data Structure for Representing Sorted Lists
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item