Polydera

trueform engine.

The STL for geometry. Fast and exact mesh booleans, spatial queries, arrangements, and remeshing. Easy to use, robust on real-world data.

C++PythonTypeScriptWASM
Read the docs GitHub Try it live

Why trueform

Easy to use

Simple code just works. Zero-copy views in C++, NumPy arrays in Python, vectorized NDArrays in the browser. Same engine underneath.

Robust by design

Exact predicates and canonical topology. Handles non-manifold flaps, inconsistent winding, coplanar faces, and pipeline artifacts.

Real-time performance

Interactive speed on million-polygon meshes. Benchmarked against MeshLib, VTK, CGAL, libigl, Coal, FCL, and nanoflann.

Queries & topology

Spatial trees for collision, distance, ray casting, and k-NN. Connectivity analysis, boundaries, and connected components.

Arrangements & booleans

Fast mesh boolean operations, multi-mesh arrangements, and self-intersection resolution. Exact predicates with canonical topology.

Remeshing & registration

Fast mesh decimation and isotropic remeshing. Point cloud alignment with ICP, OBB fitting, and rigid registration.

Performance

Fastest, on the record.

Every operation, measured against the strongest library in each ecosystem — same corpus, every language, open harnesses.

Mesh Booleans31× faster
trueform
1×
MeshLib
5.5×
Manifold
7.5×
Solidean
9.2×
CGAL
31×

The speed isn't in the algorithms — it's in the architecture around them, and how that architecture meets the hardware. What's correct on paper is rarely fast in practice. And we have years of practice.

Open any benchmark.

View all benchmarks

Integration

One engine. Three languages.

C++
cmakeconannuget
auto [result, labels, face_labels] =
 tf::make_boolean(mesh0, mesh1, tf::boolean_op::merge);
Get started Mesh Boolean Benchmarks in C++Fast Mesh Booleans in C++
Python
pip install trueform
(faces, points), labels, face_labels =
  tf.boolean_union(mesh0, mesh1)
Get started Mesh Boolean Benchmarks in PythonFast Mesh Booleans in Python
JavaScript
npm install @polydera/trueform
const { mesh, labels, faceLabels } =
  await tf.async.booleanUnion(mesh0, mesh1);
Get started Mesh Boolean Benchmarks in JavaScriptFast Mesh Booleans in JavaScript

Research

How it works, from the inside.

The algorithms behind the engine — exact arithmetic, spatial hierarchies, robust topology — published and continuously updated.

Start with the engine.

If the core geometry loop is the main risk, start here.

Open docs Try in Lunar

Free for non-commercial use·Commercial licenses available