Efficient implementation of a planar point location method

Kirkpatrick's method is extensively used to solve planar point location problem. In this paper we develop an efficient implementation for Kirkpatrick's method by developing an efficient version of the algorithms associated with the method. Efficient data structures for these more efficient algorithms are formulated. Computational experiments that were conducted verify the practical efficiency of our proposed implementation.