Methods for Achieving Fast Query Times in Point Location Data Structures (1997)

Cached

Download Links

by Michael T. Goodrich , Mark Orletsky , Kumar Ramaiyer
Citations:20 - 1 self

Documents Related by Co-Citation

256 Optimal search in planar subdivisions – D G Kirkpatrick - 1983
158 Optimal point location in a monotone subdivision – H Edelsbrunner, L J Guibas, J Stolfi - 1986
173 Planar Point Location Using Persistent Search Trees – N Sarnak, R E Tarjan - 1986
84 A fast planar partition algorithm – K Mulmuley - 1991
13 Efficient Expected-Case Algorithms for Planar Point Location – Sunil Arya, Siu-Wing Cheng, David M. Mount, H. Ramesh - 2000
17 Nearly Optimal Expected-Case Planar Point Location – Sunil Arya, Theocharis Malamatos, David M. Mount
20 A simple entropy-based algorithm for planar point location – Sunil Arya, Theocharis Malamatos, David M. Mount - 2001
14 Entropy-Preserving Cuttings and Space-Efficient Planar Point Location – Sunil Arya, Theocharis Malamatos, David M. Mount - 2001
35 A new approach to planar point location – F P Preparata - 1981
99 A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons – Raimund Seidel - 1991
13 On the Exact Worst Case Query Complexity of Planar Point Location – Udo Adamy, Raimund Seidel - 1998
11 Expected asymptotically optimal planar point location – J Iacono
252 Sorting and Searching, volume 3 of The Art of Computer Programming – Donald E Knuth - 1998
9 possible bounds on the weighted path length of optimal binary search trees – Best - 1977
93 Multidimensional searching problems – D P Dobkin, R J Lipton - 1976
5959 The mathematical theory of communication – Claude E Shannon - 1948
49 Searching and storing similar lists – R Cole - 1986
1759 Computational geometry: an introduction – F P Preparata, M I Shamos - 1985
63 Location of a point in a planar subdivision and its applications – D T Lee, F P Preparata - 1977