Walking Location Algorithms

Written by Roman Soukal

Roman Soukal

University of West Bohemia

Seminar in Czech
June 7, 2010 at 14:15
University of West Bohemia, UL411

Abstract

The point location problem is one of the most frequent tasks in computational geometry. The walking algorithms are one of the most popular solutions for finding an element in a mesh which contains a query point. Despite their suboptimal complexity, the walking algorithms are very popular because they do not require any additional memory and their implementation is simple.