- Convex hull - Gift wrapping
- Convex hull - Graham scan
- Triangulation
- Kd-tree
- Delaunay triangulation - incremental algorithm
- Voronoi diagram - constructed from Delaunay triangulation
a
- Add pointsd
- Remove pointsm
- Move pointsp
- Create polygon (end polygon by right mouse click)
r
- Generate random pointsc
- Clear screenh
- Convex hull - Gift wrappingg
- Convex hull - Graham scant
- Triangulation for convex hull or monotone polygonk
- Kd-treel
- Delaunay triangulationv
- Voronoi diagram