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§
- Polygon
Intersection Tolerances - Tolerances for polygon intersection algorithms.
- Volume
Mesh - A simplicial mesh filling the interior of a closed boundary: triangles in 2D, tetrahedra in 3D.
- Volume
Mesh Parameters - Parameters of
volume_mesh.
Enums§
- Convex
Hull Error - Errors that can occur during convex hull computation.
- Mesh
Enclosure - Which cover the mesh is (3D only): of the shape’s volume, or of its surface alone.
- 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.
- 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.
- volume_
mesh - Fills a boundary
(vertices, indices)(2D polyline, 3D triangle mesh) with a simplex mesh for finite-element simulation: 2D refines a constrained Delaunay triangulation of the boundary, 3D builds a lattice cover containing it. ReturnsNoneif the boundary encloses nothing.