Expand description
Transformation, simplification and decomposition of meshes.
Modules§
- utils
- Utilities useful for various generations tasks.
- vhacd
- Approximate convex decomposition using the VHACD algorithm.
- voxelization
- Voxelization of a 2D polyline or 3D triangle mesh.
Functions§
- convex_
hull - Computes the convex hull of a set of 2d points.
- convex_
hull_ idx - Computes the convex hull of a set of 2d points and returns only the indices of the hull vertices.
- convex_
polygons_ intersection - Computes the intersection of two convex polygons.
- convex_
polygons_ intersection_ points - Computes the intersection points of two convex polygons.
- convex_
polygons_ intersection_ points_ with_ tolerances - Computes the intersection points of two convex polygons.
- convex_
polygons_ intersection_ with_ tolerances - Computes the intersection of two convex polygons.
- hertel_
mehlhorn - The Hertel-Mehlhorn algorithm.
- hertel_
mehlhorn_ idx - Internal implementation of the Hertel-Mehlhorn algorithm that returns the polygon indices.
- polygons_
intersection - Compute intersections between two polygons that may be non-convex but that must not self-intersect.
- polygons_
intersection_ points - Compute intersections between two polygons that may be non-convex but that must not self-intersect.