Convex Hull & Delaunay Triangulation

Graham scan · Incremental Delaunay · Voronoi dual · Click to add points

Click to add points · Right-click to remove nearest · Drag to move

Display

Points: 0
Hull vertices: 0
Triangles: 0
Voronoi cells: 0
Delaunay property: No point inside any circumcircle — maximizes minimum angle.
Voronoi dual: Connect circumcenters of adjacent triangles.
Graham scan: O(n log n) hull algorithm — polar angle sort + stack.