Proximate point searching
From MaRDI portal
Publication:598552
DOI10.1016/j.comgeo.2004.01.005zbMath1140.68509MaRDI QIDQ598552
Erik D. Demaine, Stefan Langerman, John Iacono
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
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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