Skip to main content
Article thumbnail
Location of Repository

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

By Gill Barequet and Sariel Har-Peled

Abstract

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 R³. 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

Topics: 4pproximation, bounding box
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.8368
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://wwwdev.cs.stevens.edu/~... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.