Efficient implementation of a planar point location method

Authors:
Abdullah Zawawi Talib;Ahmad Izani Md. Ismail;Min Chen
Affiliations:
University of Science Malaysia, Penang, Malaysia;University of Science Malaysia, Penang, Malaysia;University of Wales Swansea, Swansea, Britain
Venue:
Proceedings of the 2nd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Year:
2004

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
A heuristic triangulation algorithm

Journal of Algorithms
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry
A new point-location algorithm and its practical efficiency: comparison with existing algorithms

ACM Transactions on Graphics (TOG)
Three Major Extensions to Kirkpatrick's Point Location Algorithm

CGI '96 Proceedings of the 1996 Conference on Computer Graphics International

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.