Minimum bounding box algorithms

It is sufficient to find the smallest enclosing box for the convex hull of the objects in question.

[1] It is possible to enumerate boxes of this kind in linear time with the approach called rotating calipers by Godfried Toussaint in 1983.

[3] In 1985, Joseph O'Rourke published a cubic-time algorithm to find the minimum-volume enclosing box of a 3-dimensional point set.

[4] It is also possible to approximate the minimum bounding box volume, to within any constant factor greater than one, in linear time.

Finally, O'Rourke's algorithm is applied to find the exact optimum bounding box of this coreset.