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.
Structs§
- Metadata that specifies thresholds to use when making construction choices in mesh intersections.
Enums§
- Errors generated by the convex-hull calculation.
- Error indicating that a query is not supported between certain shapes
Functions§
- Checks if a convex-hull is properly formed.
- Computes the convex hull of a set of 3d points.
- Computes the intersection of two convex polygons.
- Computes the intersection points of two convex polygons.
- Computes the intersection points of two convex polygons.
- Computes the intersection of two convex polygons.
- Computes the intersection of two meshes.
- Similar to
intersect_meshes
. - Compute intersections between two polygons that may be non-convex but that must not self-intersect.
- Compute intersections between two polygons that may be non-convex but that must not self-intersect.
- Computes the convex hull of a set of 3d points.