The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
Open accessAbstract
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 R3. We also present a simpler algorithm whose running time is O(nlogn+n/?3). We give some experimental results with implementations of various variants of the second algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
Faloutsos, C., & Lin, K.-I. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223812 · Cited by 897
Efficient collision detection using bounding volume hierarchies of k-DOPs
Klosowski, J. T., Held, M., Mitchell, J. S. B., Sowizral, H., & Zikan, K. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.675649 · Cited by 873
Applications of random sampling in computational geometry, II
Clarkson, K. L., & Shor, P. W. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187740 · Cited by 665
Solving geometric problems with the rotating calipers
Toussaint, G. T. (1983) · Cited by 514
Collision detection for interactive graphics applications
Hubbard, P. M. (1995) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.466717 · Cited by 414
Finding minimal enclosing boxes
O'Rourke, J. (1985) · International Journal of Computer & Information Sciences · doi:10.1007/bf00991005 · Cited by 238
Faloutsos, C., & Lin, K.-I. (1995) · ACM SIGMOD Record · doi:10.1145/568271.223812 · Cited by 190
Metric Entropy of Some Classes of Sets with Differentiable Boundaries
Dudley, R. M. (2010) · Springer eBooks · doi:10.1007/978-1-4419-5821-1_26 · Cited by 189
Cited by
Zwanenburg, A., Vallières, M., Abdalah, M. A., Aerts, H. J. W. L., Andrearczyk, V., Apte, A., Ashrafinia, S., Bakas, S., Beukinga, R. J., Boellaard, R., et al. (2020) · Radiology · doi:10.1148/radiol.2020191145 · Cited by 4,177
Hypersim: A Photorealistic Synthetic Dataset for Holistic Indoor Scene Understanding
Roberts, M., Ramapuram, J., Ranjan, A., Kumar, A., Bautista, M. A., Paczan, N., Webb, R., & Susskind, J. M. (2021) · 2021 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.01073 · Cited by 358
Metadata
- Authors
- Barequet, G., & Har-Peled, S.
- Venue
- Journal of Algorithms
- Publisher
- Elsevier BV
- Published
- 2001-01
- Volume
- 38
- Issue
- 1
- Pages
- 91-109
- ISSN
- 0196-6774 (ISSN-L)
- OpenAlex
- W2079872371
- Cited by
- 287
- References
- 11
- FWCI
- 20.20
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. https://app.cochat.ai/papers/10.1006/jagm.2000.1127
- The paper
- Barequet, G., & Har-Peled, S. (2001). Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. Journal of Algorithms. https://doi.org/10.1006/jagm.2000.1127
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
