About the Point Location Problem

In this chapter we present some well-known algorithms for the solution of the point location problem and for the more particular problem of point-in-polygon determination. These previous approaches to the problem are presented in the first sections. In the remainder of the paper, we present a quick location algorithm based on a quaternary partition of the space, as well as its associated computational cost.

[1]  Alan E. Middleditch,et al.  Convex Decomposition of Simple Polygons , 1984, TOGS.

[2]  E. Heller An international journal. , 1968, Canadian Medical Association journal.