Algorithm to find optimal bounding volume for point cloud

598 views Asked by At

For a point cloud do there exist algorithms to tell the bounding volume that bounds the points in the most compact way, or in a way that minimizes the empty spaces inside the bounding volume? Examples of the bounding volumes in question are bounding boxes, spheres, cylinders and capsules.

1

There are 1 answers

0
AudioBubble On

The problem is trivial for the axis-aligned boxes.

For arbitrary boxes, I guess that a generalization of rotating calipers is possible (compute the convex hull and try all orientations defined by a plane that contains a face and another plane containing an edge).

For spheres, use the Welzl algorithm.

For a cylindre or a capsule, mh, good luck...