Benchmarks | TS
Overview
Performance comparisons against VTK, CGAL, libigl, Coal, FCL, and nanoflann.
TrueForm enables real-time geometric operations on million-polygon meshes. On a pair of 1M-polygon meshes, boolean union completes in 28ms and intersection curve extraction in 7ms. Try it live in your browser →
The TypeScript SDK uses the same C++ core compiled to WebAssembly, so performance characteristics are identical (accounting for WASM overhead). See the C++ benchmarks for experimental setup, detailed charts, and scaling analysis.
Summary
Sample comparisons against VTK, CGAL, libigl, Coal, FCL, and nanoflann:
| Operation | Input | Time | Speedup | Baseline | TrueForm |
|---|---|---|---|---|---|
| Boolean Union | 2 × 1M | 28 ms | 84× | CGAL Simple_cartesian<double> | reduction diagrams, double |
| Mesh–Mesh Curves | 2 × 1M | 7 ms | 233× | CGAL Simple_cartesian<double> | reduction diagrams, double |
| ICP Registration | 1M | 7.7 ms | 93× | libigl | AABB tree, random subsampling |
| Self-Intersection | 1M | 78 ms | 37× | libigl EPECK (GMP/MPFR) | reduction diagrams, double |
| Isocontours | 1M, 16 cuts | 3.8 ms | 38× | VTK vtkContourFilter | reduction diagrams, float |
| Connected Components | 1M | 15 ms | 10× | CGAL | parallel union-find |
| Boundary Paths | 1M | 12 ms | 11× | CGAL | Hierholzer's algorithm |
| k-NN Query | 500K | 1.7 µs | 3× | nanoflann k-d tree | AABB tree |
| Mesh–Mesh Distance | 2 × 1M | 0.2 ms | 2× | Coal (FCL) OBBRSS | OBBRSS tree |
| Decimation (50%) | 1M | 72 ms | 50× | CGAL edge_collapse | parallel partitioned collapse |
| Principal Curvatures | 1M | 25 ms | 55× | libigl | parallel k-ring quadric fitting |
To learn more about the reduction diagrams and the theoretical foundations of trueform, see our Research.
Detailed Results
For full benchmark charts, scaling analysis, and experimental setup, see the C++ benchmark documentation:
