GSoC/GCI Archive
Google Summer of Code 2012 CGAL - Computational Geometry Algorithms Library

Enhancing the Landmarks point-location strategy for 2D arrangements

by Victor Lopez for CGAL - Computational Geometry Algorithms Library

One of the most important query types defined on arrangements is the point-location query: Given a point, find the arrangement cell that contains it. Typically, the result of a point-location query is one of the arrangement faces, but in degenerate situations the query point can be located on an edge or coincide with a vertex. The 2D Arrangements package supports different strategies of point location. The goal of the project to enhance the implementation of a specific strategy called Landmarks.