Proximate point searching (2002)

by Erik D. Demaine , John Iacono , Stefan Langerman
Venue:In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG
Citations:11 - 5 self

Documents Related by Co-Citation

10 Optimal Planar Point Location – John Iacono - 2001
35 The Diameter of Nearest Neighbor Graphs – David Eppstein - 1992
186 Relative neighborhood graphs and their relatives – Jerzy W. Jaromczyk, Godfried T. Toussaint - 1992
125 Classes of graphs which approximate the complete Euclidean graph – J M Keil, C A Gutwin - 1992
51 TARJAN, Design and analysis of a data structure for representing sorted lists – M R BROWN, R E
20 A simple entropy-based algorithm for planar point location – Sunil Arya, Theocharis Malamatos, David M. Mount - 2001
256 Optimal search in planar subdivisions – D G Kirkpatrick - 1983
45 On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof – Richard Cole
64 Generalized Delaunay triangulation for planar graphs – D T Lee - 1986
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
40 Randomized and Deterministic Algorithms for Geometric Spanners of Small Diameter – Sunil Arya, David M. Mount, Michiel Smid - 1994
20 Ordered Theta Graphs – Prosenjit Bose, Joachim Gudmundsson, Pat Morin
3 Proximate point location – J Iacono, S Langerman - 2003
5 Region Counting Graphs – Jean Cardinal, Sébastien Collette, Stefan Langerman
190 On constructing minimum spanning trees in k−dimensional space and related problems – A C Yao - 1982
24 A Note on Point Location in Delaunay Triangulations of Random Points – L. Devroye, E. P. Mucke, Binhai Zhu - 1998
36 The Delaunay hierarchy – Olivier Devillers
15 High Dimensional Similarity Search With Space Filling Curves – Swanwa Liao, Mario A. Lopez, Scott T. Leutenegger - 2000
43 Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues – Arne Andersson, Mikkel Thorup - 2000