Module transformation

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.

Enums

PolygonsIntersectionError

Error type for polygon intersection operations.

PolylinePointLocation

Location of a point on a polyline.

Functions

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.