Journal
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC
Volume 38, Issue 1, Pages 91-109Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1006/jagm.2000.1127
Keywords
approximation; bounding box
Ask authors/readers for more resources
We present an efficient O(n + 1/epsilon (4.5))-time algorithm for computing a (1 + epsilon)-approximation of the minimum-volume bounding box of n points in R-3. We also present a simpler algorithm whose running time is O(n log n + n/epsilon (3)). We give some experimental results with implementations of various variants of the second algorithm. (C) 2001 Academic Press.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available