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

@article{Barequet1999EfficientlyAT,
  title={Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions},
  author={Gill Barequet and Sariel Har-Peled},
  journal={J. Algorithms},
  year={1999},
  volume={38},
  pages={91-109}
}
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 Influential
This paper has highly influenced 23 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 271 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 163 extracted citations

LATIN 2012: Theoretical Informatics

Lecture Notes in Computer Science • 2012
View 11 Excerpts
Highly Influenced

iVu.KOM: A Framework for Viewer-centric Mobile Location-based Services

Praxis der Informationsverarbeitung und Kommunikation • 2010
View 9 Excerpts
Highly Influenced

A space-optimal data-stream algorithm for coresets in the plane

Symposium on Computational Geometry • 2007
View 5 Excerpts
Highly Influenced

Faster core-set constructions and data stream algorithms in fixed dimensions

Symposium on Computational Geometry • 2004
View 8 Excerpts
Highly Influenced

271 Citations

01020'99'03'08'13'18
Citations per Year
Semantic Scholar estimates that this publication has 271 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…