The fastest JavaScript library for Delaunay triangulation of 2D points. Implements a variation of the Sweep-hull algorithm.
var points = [[168, 180], [168, 178], [168, 179], [168, 181], [168, 183], ...];
var delaunay = new Delaunator(points);
console.log(delaunay.triangles);
- Implement the algorithm.
- Add a simple demo.
- Add proper tests.
- Add a benchmark against similar libraries.
- Clean up and document the API.
- Release the first version to NPM.