Optimized triangulation of connected planar regions

Emil Alexander Röhrich, Leibniz Universität Hannover, Studienarbeit
09/2004

A fast Delaunay triangulation algorithm has been implemented for polygonal connected planar regions. Especially a fast retrospective point insertion has been achieved in constant time. Furthermore constrained edges (boundary edges and inner edges) have been incorporated.

Contact: Martin Reuter