Skip to main content
Article thumbnail
Location of Repository

A Small Improvement in the Walking Algorithm for Point Location in a Triangulation

By Ivana Kolingerova

Abstract

The paper shows a simple technique which saves some edge tests in the walking algorithm for point location. The walking technique does not achieve the logarithmic per point complexity of the location-datastructure-based methods but does not need any auxiliary data structure and is very simple to implement, therefore, it is very popular in practice. The suggested idea did not bring a substantial improvement in our tests but it is very simple and there is an open door to further more substantial improvement in the future research

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.3849
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://delaunay.tem.uoc.gr/~mk... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.