pcfitcuboid
R2026bFit cuboid to 3-D point cloud
Description
Examples
Input Arguments
Output Arguments
Algorithms
This algorithm uses the convex hull of the points in the input point cloud to compute an oriented bounding cuboid. The algorithm performs these steps:
Compute the convex hull of the 3-D points.
For each face of the convex hull, compute a candidate cuboid with one face coplanar with the convex hull face.
Select the candidate cuboid with the smallest volume.
When the convex hull contains only a small number of faces, the orientation of the true minimum-volume cuboid might not align with any convex hull face. Because the algorithm considers only orientations derived from convex hull faces, it can return a suboptimal bounding cuboid. For example, four non-coplanar points form a tetrahedral convex hull with only four faces, and the optimal cuboid orientation might not align with any of them.


