Expand description

Transformation, simplification and decomposition of meshes.

Modules

Utilities useful for various generations tasks.
Approximate convex decomposition using the VHACD algorithm.
Voxelization of a 2D polyline or 3D triangle mesh.

Functions

Computes the convex hull of a set of 2d points.
Computes the convex hull of a set of 2d points and returns only the indices of the hull vertices.
Computes the intersection of two convex polygons.
Computes the intersection points of two convex polygons.
The Hertel-Mehlhorn algorithm.
Internal implementation of the Hertel-Mehlhorn algorithm that returns the polygon indices.