Spatial tree build
Build a query-ready spatial hierarchy over an indexed triangle mesh already in memory.
TutorialsMesh collision detection in C++Mesh collision detection in PythonMesh collision detection in JavaScriptClosest point on a mesh in C++Closest point on a mesh in PythonClosest point on a mesh in JavaScript

trueform builds a query-ready AABB tree over the 1.03M-face dragon in 7.87 ms, versus 34.4 ms for MeshLib and 177 ms for CGAL: 4.4× and 22× faster. The mesh is in memory before the clock; each library’s mesh conversion is not timed. trueform and MeshLib parallel; CGAL serial. Apple M4 Max, 16 threads, trueform 0.10.10.











