[1] H. Edelsbrunner, L. J. Guibas and J. Stolfi. Optimal point location in a monotone subdivision. SIAM J. Comput., 15:317-340, 1986.

[2] D. G. Kirkpatric. Optimal search in planar subdivisions. SIAM J. Comp., 12:28-35,1983

[3] N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29:669-679, 1986.

[4] R. Cole. Searching and storing similar list. J. Algorithm, 7:202-220, 1986.

[5] K. Mulmuley. A fast planar partition algorithm, I. Journal of Symbolic Computation, 10:253-280, 1990.

[6] Computational Geometry: Algorithms and Applications, Mark de Berg, Marc van Kreveld, Mark Overmars, Utrecht (the Netherlands) and Otfried Schwarzkopf Hong Kong (China), 6:121-144, 2000

[7] Point Location by Sergi Elizalde & David Pritchard

[8] A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decomposition and for Triangulating Polygons, Raimund Seidel, Computational Geometry: Theory and Applications, Vol. 1, 1991, pp. 51-64