Benchmarks | PY

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 32ms and intersection curve extraction in 11ms. Try it live in your browser →

The Python bindings use the same C++ core, so performance characteristics are identical. See the C++ benchmarks for experimental setup, detailed charts, and scaling analysis.

Summary

Sample comparisons against VTK, CGAL, libigl, Coal, FCL, and nanoflann:

OperationInputTimeSpeedupBaselineTrueForm
Boolean Union2 × 1M32 ms76×CGAL Simple_cartesian<double>reduction diagrams, double
Mesh–Mesh Curves2 × 1M11 ms150×CGAL Simple_cartesian<double>reduction diagrams, double
Self-Intersection1M78 ms37×libigl EPECK (GMP/MPFR)reduction diagrams, double
Isocontours1M, 16 cuts4.2 ms40×VTK vtkContourFilterreduction diagrams, float
Connected Components1M16 ms11×CGALparallel union-find
Boundary Paths1M12 ms12×CGALHierholzer's algorithm
k-NN Query500K1.7 µsnanoflann k-d treeAABB tree
Mesh–Mesh Distance2 × 1M0.2 msCoal (FCL) OBBRSSOBBRSS tree
Principal Curvatures1M25 ms55×libiglparallel 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:

Spatial

AABB tree construction, k-NN queries, and mesh–mesh distance.

Topology

Connected component extraction and boundary path detection.

Geometry

Curvature estimation and geometric analysis.

Intersect

Isocontour extraction and mesh–mesh intersection curves.

Cut

Boolean operations, self-intersection detection, and curve embedding.

I/O

File reading and writing performance.