Module transformation

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.

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.

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 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.
hertel_mehlhorn: The Hertel-Mehlhorn algorithm.
hertel_mehlhorn_idx: Internal implementation of the Hertel-Mehlhorn algorithm that returns the polygon indices.
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.
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.