Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

@inproceedings{Barequet1999EfficientlyAT,
  title={Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions},
  author={Gill Barequet and Sariel Har-Peled},
  booktitle={SODA},
  year={1999}
}
We present an efficient O(n + l/~~.~) time algorithm for computing an (I +E)-approximation of the minimum-volume bounding box of n points in R3. We also present a simpler algorithm, (for the same purpose) whose running time is O(n log n + n/c3). We give some experimental results with implementations of various variants of the second algorithm. keywords: -4pproximation, bounding box. 
Highly Cited
This paper has 25 citations. REVIEW CITATIONS