On the Exact Worst Case Query Complexity of Planar Point Location (1998)

Cached

Download Links

by Udo Adamy , Raimund Seidel
Venue:IN PROCEEDINGS OF THE NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
Citations:12 - 0 self

Active Bibliography

14 Nearly Optimal Expected-Case Planar Point Location – Sunil Arya, Theocharis Malamatos, David M. Mount
19 Methods for Achieving Fast Query Times in Point Location Data Structures – Michael T. Goodrich, Mark Orletsky - 1997
ENTROPY, TRIANGULATION, AND POINT LOCATION IN PLANAR SUBDIVISIONS – Sébastien Collette, Université Libre De Bruxelles, Vida Dujmović, Stefan Langerman, Université Libre De Bruxelles, John Iacono, Pat Morin - 2009
2 DISTRIBUTION-SENSITIVE POINT LOCATION IN CONVEX SUBDIVISIONS – Sébastien Collette, John Iacono, Stefan Langerman, Pat Morin
46 Dynamic Trees and Dynamic Point Location – Michael T. Goodrich, Roberto Tamassia - 1991
13 Entropy-Preserving Cuttings and Space-Efficient Planar Point Location – Sunil Arya, Theocharis Malamatos, David M. Mount - 2001
6 On Point Location and Motion Planning among Simplices – Marco Pellegrini - 1996
12 Efficient Expected-Case Algorithms for Planar Point Location – Sunil Arya, Siu-Wing Cheng, David M. Mount, H. Ramesh - 2000
9 Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization – Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos - 2000
16 Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions – Yi-jen Chiang, Roberto Tamassia - 1992
1 Succinct Geometric Indexes Supporting Point Location Queries – Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin
2 Efficient computation of query point visibility in polygons with holes – Ali Reza, Zarei Mohammad Ghodsi - 2005
3 Visibility in Simple Polygons – Prosenjit K. Bose - 1991
12 Robust Proximity Queries in Implicit Voronoi Diagrams – Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia - 1996
4 Fast fractional cascading and its applications – Qingmin Shi, Joseph Jaja - 2003
1 Novel transformation techniques using q-heaps with applications to computational geometry – Qingmin Shi, Joseph Jaja
17 Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results – Yi-Jen Chiang - 1995
3 Trace Size vs Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs – Robert H.B. Netzer, Robert H. B. Netzer - 1993
8 Optimal Cooperative Search In Fractional Cascaded Data Structures – Roberto Tamassia, Jeffrey Scott Vitter - 1995