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

258 Optimal search in planar subdivisions – David Kirkpatrick - 1983
174 Planar point location using persistent search trees – NEIL SARNAK, ROBERT TARJAN - 1986
159 Optimal point location in a monotone subdivision – H Edelsbrunner, L J Guibas, J Stol - 1986
83 A fast planar partition algorithm – K Mulmuley - 1988
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
6294 A mathematical theory of communication – C E Shannon - 1948
988 Computational geometry : algorithms and applications – M de Berg, O Cheong, M van Kreveld, M Overmars - 2008
1788 Computational Geometry: An Introduction – F Preparata, M Shamos - 1988