→ 3d-quickhull

A header only implementation of convex hull triangulation

I got myself in the need to perform easily mesh triangulation of a set of points in space to generate 3d meshes. One recent application of this library has been to generate l-system trees in a low-polygon style. The library is not yet optimal in terms of memory consumption; for now it has only used for offline mesh generation but fixes concerning this are in the roadmap.

If you are curious about the speed, some benchmarks of version 1.1 are available here (2.6 GHz Intel Core i7 on those 3d models).

The algorithm implemented is the iterative version of 3d quickhull. source code available under MIT here.

01.11.16
©
karim naaji ⋅ 2013-2017