Visualizing Delaunay Triangulation
Summary
The post explains Delaunay triangulation, its maximum-minimum-angle property, and walks through an incremental Guibas & Stolfi algorithm using a quad-edge data structure. It covers point-in-circle tests, local vs global properties, and practical considerations for implementing the algorithm, including boundary handling and data structure design.