Answers are grounded in this paper and cite their sources.
Given a subdivision of the plane induced by a planar graph with n vertices, in this paper we consider the problem of identifying which region of the subdivision contains a given test point. We present a search algorithm, called point-location algorithm, which operates on a suitably preprocessed data structure. The search runs in time at most O((log n)²), while the preprocessing task runs in time at most O(n log n) and requires $O(n)$ storage. The methods are quite general, since an arbitrary subdivision can be transformed in time at most O(n log n) into one to which the preprocessing procedure is applicable. This solution of the point location problem yields interesting and efficient solutions of other geometric problems, such as spatial convex inclusion and inclusion in an arbitrary polygon.
No takes yet. Share an insight, caveat, or question.
Lee et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: