Optimal Point Location in a Monotone Subdivision

  title={Optimal Point Location in a Monotone Subdivision},
  author={Herbert Edelsbrunner and Leonidas J. Guibas and Jorge Stolfi},
  journal={SIAM J. Comput.},
Point location, often known in graphics as “hit detection,” is one of the fundamental problems of computational geometry. In a point location query we want to identify which of a given collection of geometric objects contains a particular point. Let $\mathcal{S}$ denote a subdivision of the Euclidean plane into monotone regions by a straight-line graph of m edges. In this paper we exhibit a substantial refinement of the technique of Lee and Preparata [SIAM J. Comput., 6 (1977), pp. 594–606] for… 
A simple entropy-based algorithm for planar point location
This paper shows that a very simple modification of a well-known randomized incremental algorithm can be applied to produce a data structure of expected linear size that can answer point location queries in average time.
Planar Point Location Using Persistent Search Trees a
The Dobkin-Lipton result raised the question of whether an O(log n ) bound on query time can be achieved using only O(n) space, which is optimal if the planar subdivision must be stored, and showed that this lower bound is tight.
Improved Implementation of Point Location in General Two-Dimensional Subdivisions
We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in Cgal, the Computational Geometry
Optimal Expected-Case Planar Point Location
It is shown that it is possible to achieve query time H + O(\sqrt{H}+1)$ with space, which is optimal up to lower order terms in the query time, and the concept of entropy-preserving cuttings is introduced in order to achieve space efficiency.
On Geometric Path Query Problems
This dissertation constructs efficient data structures that enable fast reporting of an "optimal" obstacle-avoiding path between two arbitrary query points s and t that are given in an on-line fashion.
Programming Techniques and Data Structures Planar Point Location Using
This work develops a persistent form of binary search tree that supports insertions and deletions in the present and queries in the past, and provides an alternative to Chazelle’s “hive graph” structure, which has a variety of applications in geometric retrieval.
Planar Point Location in Sublogarithmic Time
  • M. Patrascu
  • Mathematics, Computer Science
    2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
  • 2006
The first solution to the static planar point location problem in an arbitrary polygonal subdivision given by n segments is given, which gives the first solution which can surpass the traditional query time of O(lgn).
An experimental study of point location in planar arrangements in CGAL
The results indicate that compared to the other algorithms tested, the landmarks approach is the most efficient, when the overall (amortized) cost of a query is taken into account, combining both preprocessing and query time.
Dynamic Trees and Dynamic Point Location
This appears to be the first on-line method to achieve a polylogarithmic query time and constant update time and an improved method for spatial point location in a 3-dimensional convex subdivision.
Adaptive Point Location in Planar Convex Subdivisions
This work presents a planar point location structure for a convex subdivision S and shows that the running time is only worse than the best possible bound by \(O(\log \log n)\) per query, which is much smaller than the query time offered by an worst-case optimal planarpoint location structure.


Location of a Point in a Planar Subdivision and Its Applications
A search algorithm, called point-location algorithm, which operates on a suitably preprocessed data structure, which yields interesting and efficient solutions of other geometric problems, such as spatial convex inclusion and inclusion in an arbitrary polygon.
A New Approach to Planar Point Location
This paper presents a practical algorithm which runs in less than $6\lceil {\log _2 n} \rceil $ comparisons on a data structure which uses O(n\log n) storage, in the worst case.
Optimal Search in Planar Subdivisions
This work presents a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely $O(\log n)$ search time with $O(n)$ storage.
Depth-First Search and Linear Graph Algorithms
The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components
Geometric complexity
  • M. Shamos
  • Mathematics, Computer Science
  • 1975
An effort is made to recast classical theorems into a useful computational form and analogies are developed between constructibility questions in Euclidean geometry and computability questions in modern computational complexity.
Application of a Planar Separator Theorem
Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√n) vertices. This separator theorem, in combination with a
Testing a Simple Polygon for Monotonicity