Expand description
Transformation, simplification and decomposition of meshes.
Modules§
- utils
- Low-level utilities for mesh and geometry generation.
- vhacd
- Approximate convex decomposition using the VHACD algorithm. Approximate Convex Decomposition using the V-HACD algorithm.
- voxelization
- Voxelization of a 2D polyline or 3D triangle mesh. Voxelization of 2D and 3D shapes.
Structs§
- Mesh
Intersection Tolerances - Metadata that specifies thresholds to use when making construction choices in mesh intersections.
- Polygon
Intersection Tolerances - Tolerances for polygon intersection algorithms.
Enums§
- Convex
Hull Error - Errors that can occur during convex hull computation.
- Mesh
Intersection Error - Errors that can occur when computing the boolean intersection of two triangle meshes.
- Polygons
Intersection Error - Error type for polygon intersection operations.
- Polyline
Point Location - Location of a point on a polyline.
Functions§
- check_
convex_ hull - Checks if a convex-hull is properly formed.
- convex_
hull - Computes the convex hull of a set of 3D points.
- convex_
polygons_ intersection - Computes the intersection of two convex polygons with closure-based output.
- 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 with custom tolerances.
- convex_
polygons_ intersection_ with_ tolerances - Computes the intersection of two convex polygons with custom tolerances and closure-based output.
- intersect_
meshes - Computes the intersection of two meshes.
- intersect_
meshes_ with_ tolerances - Similar to
intersect_meshes. - polygons_
intersection - Computes the intersection of two possibly non-convex polygons with closure-based output.
- polygons_
intersection_ points - Computes the intersection points of two possibly non-convex polygons.
- try_
convex_ hull - Computes the convex hull of a set of 3D points, with error handling.