Incremental Delaunay Triangulation

Abstract

This document describes the implementation in ITK of the Incremental Delaunay Triangulation algorithm. Using the Straight Walk in Triangulation function, the exact discrete geometrical orientation predicate, and the itk::QuadEdgeMesh API of ITK , we propose a geometrically exact and robust implementation that, from a given 2-dimensional itk::PointSet, incrementally constructs the corresponding 2-dimensional Delaunay Triangulation as an itk::QuadEdgeMesh.