Skip to main content

Module transformation

Module transformation 

Source
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§

PolygonIntersectionTolerances
Tolerances for polygon intersection algorithms.
VolumeMesh
A simplicial mesh filling the interior of a closed boundary: triangles in 2D, tetrahedra in 3D.
VolumeMeshParameters
Parameters of volume_mesh.

Enums§

ConvexHullError
Errors that can occur during convex hull computation.
MeshEnclosure
Which cover the mesh is (3D only): of the shape’s volume, or of its surface alone.
PolygonsIntersectionError
Error type for polygon intersection operations.
PolylinePointLocation
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. Returns None if the boundary encloses nothing.