Efficiently Approximating the Minimum-Vo
✍
Gill Barequet; Sariel Har-Peled
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 221 KB
We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of