VoronoiX (or VX) - C++ library, with JS interface on top of it, that allows to work with different data structures and algorithms related to Voronoi diagram, Delaunay triangulation and other geometric structures.
- QHull algorithm (k-dimensional convex hull)
- Intersection of half-spaces (using plane-point duality: blog, wiki
- Support of various spaces (even with curvature)
- 2D Plane
- 3D Space
- kD Hyperspace
- Sphere
- Cube
- Various geometric structures and algorithms
- Voronoi diagram
- Delaunay triangulation
- Euclidean minimal spanning tree
- Minimal empty circle
- Nearest point
- Safest path
- Convex hull
- Robustness (HOPEFULLY :D )
- C++ library
- JS binding
3D Voronoi diagram inside a cube
Convex hull of points randomly distributed on sphere
Convex hull of points projected from a plane onto a paraboloid.
The edges of this convex hull corresponds to the edges of Delaunay triangulation
on 2D plane.
