research-article

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

Authors:

Sariel Har-PeledAuthors Info & Claims

Journal of Algorithms, Volume 38, Issue 1

Pages 91 - 109

https://doi.org/10.1006/jagm.2000.1127

Published: 01 January 2001 Publication History

Abstract

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.

References

[1]

P.K. Agarwal, S. Har-Peled, M. Sharir, K.R. Varadarajan, Approximate shortest paths on a convex polytope in three dimensions, J. Assoc. Comput. Mach., 44 (1997) 567-584.

Digital Library

[2]

G.E. Andrews, A lower bound for the volume of strictly convex bodies with many boundary lattice points, Trans. Amer. Math. Soc., 106 (1963) 270-279.

[3]

G. Barequet, B. Chazelle, L.J. Guibas, J.S.B. Mitchell, A. Tal, BOXTREE: A hierarchical representation for surfaces in 3D, Comput. Graphics Forum, 15 (1996) C387-C396.

[4]

N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, The r*-tree: An efficient and robust access method for points and rectangles, in ACM SIGMOID International Conference on Management of Data, 1990, pp. 322-331.

Digital Library

[5]

S. Bespamyatnikh and M. Segal, Covering a set of points by two axis-parallel boxes, in Proceedings, 9th Canadian Conference on Computational Geometry, 1997, 33-38.

[6]

T.M. Chan, Output-sensitive results on convex hulls, extreme points, and related problems, Discrete Comput. Geom., 16 (1996) 369-387.

Digital Library

[7]

K.L. Clarkson, P.W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4 (1989) 387-421.

Digital Library

[8]

R.M. Dudley, Metric entropy of some classes of sets with differentiable boundaries, J. Approx. Theory, 10 (1974) 227-236.

[9]

O. Egecioglu, B. Kalantari, Approximating the diameter of a set of points in the Euclidean space, Inform. Process. Lett., 32 (1989) 205-211.

[10]

C. Faloutsos, K.-I. Lin, FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets, ACM SIGMOD Record, 24 (1995) 163-174.

[11]

O.D. Faugeras, J. Ponce, An object-centered hierarchical representation for 3-d objects: The prism-tree, Comput. Vision, Graphics, Image Process., 38 (1987) 1-28.

Digital Library

[12]

P. Gritzmann, V. Klee, Inner and outer j-radii of convex bodies in finite-dimensional normed spaces, Discrete Comput. Geom., 7 (1992) 255-280.

Digital Library

[13]

S. Gottschalk, M. C. Lin, and D. Manocha, OBB-tree: A hierarchical structure for rapid interference detection,in Proceedings, SIGGRAPH '96, 1992, pp. 171-180.

[14]

S. Har-Peled, Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions, Discrete Comput. Geom., 21 (1999) 216-231.

[15]

P.M. Hubbard, Collision detection for interactive graphics applications, IEEE Trans. Visual. Compu. Graphics, 1 (1995) 218-230.

Digital Library

[16]

J. Klosowski, M. Held, J.S.B. Mitchell, K. Zikan, H. Sowizral, Efficient collision detection using bounding volume hierarchies of k-DOPs, IEEE Trans. Visual. Comput. Graphics, 4 (1998) 21-36.

Digital Library

[17]

J. O'Rourke, Finding minimal enclosing boxes, Int. J. Comput. Inform. Sci., 14 (1985) 183-199.

[18]

N. Roussopoulos and D. Leifker, Direct spatial search on pictorial databases using packed r-trees, in Proceedings, ACM SIGACT-SIGMOD Conference on Principles of Database Systems, 1985, pp. 17-31.

Digital Library

[19]

H. Samet, Addison¿Wesley, Reading, 1989.

[20]

T. Sellis, N. Roussopoulos, and C. Faloutsos, The R+-tree: A dynamic index for multi-dimensional objects, in Proceedings, 13th Conference on Very Large Databases, 1987, pp. 507-517.

[21]

G. T. Toussaint, Solving geometric problems with the rotating calipers, in Proceedings IEEE MELECON, 1983, pp. 1-4.

Cited By

Delprat SÁlvarez JSánchez MBernal M(2021)A Tighter Exact Convex Modeling for Improved LMI-Based Nonlinear System Analysis and DesignIEEE Transactions on Fuzzy Systems10.1109/TFUZZ.2020.300534529:9(2819-2824)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1109/TFUZZ.2020.3005345
Lazaridis LPapatsimouli MKollias KSarigiannidis PFragulis G(2021)Hitboxes: A Survey About Collision Detection in Video GamesHCI in Games: Experience Design and Game Mechanics10.1007/978-3-030-77277-2_24(314-326)Online publication date: 24-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-77277-2_24
Bicchi ABrock OPozzi MMarullo SSalvietti GBimbo JMalvezzi MPrattichizzo D(2020)Hand closure model for planning top grasps with soft robotic handsInternational Journal of Robotics Research10.1177/027836492094746939:14(1706-1723)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1177/0278364920947469
Show More Cited By

Index Terms

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
  2. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis

Recommendations

Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Tverberg Points in Linear Time for Any Fixed Dimension

Let $$P \subseteq \mathbb{R }^d$$P⊆Rd be a $$d$$d-dimensional $$n$$n-point set. A Tverberg partition is a partition of $$P$$P into $$r$$r sets $$P_1, \dots , P_r$$P1,ź,Pr such that the convex hulls $$\hbox {conv}(P_1), \dots , \hbox {conv}(P_r)$$conv(P1)...
On the Union of Cylinders in Three Dimensions

We show that the combinatorial complexity of the union of n infinite cylinders in ź3, having arbitrary radii, is O(n2+ź), for any ź>0; the bound is almost tight in the worst case, thus settling a conjecture of Agarwal and Sharir (Discrete Comput. Geom. ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Algorithms

Journal of Algorithms Volume 38, Issue 1

Jan. 2001

334 pages

ISSN:0196-6774

Editors:
Zvi Galil
Columbia Univ., New York, NY
,
David S. Johnson
AT&T Lab—Research, Florham Park, NJ
,
Donald E. Knuth
Stanford Univ., Stanford, CA

Issue’s Table of Contents

Copyright © Academic Press.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 January 2001

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Delprat SÁlvarez JSánchez MBernal M(2021)A Tighter Exact Convex Modeling for Improved LMI-Based Nonlinear System Analysis and DesignIEEE Transactions on Fuzzy Systems10.1109/TFUZZ.2020.300534529:9(2819-2824)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1109/TFUZZ.2020.3005345
Lazaridis LPapatsimouli MKollias KSarigiannidis PFragulis G(2021)Hitboxes: A Survey About Collision Detection in Video GamesHCI in Games: Experience Design and Game Mechanics10.1007/978-3-030-77277-2_24(314-326)Online publication date: 24-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-77277-2_24
Bicchi ABrock OPozzi MMarullo SSalvietti GBimbo JMalvezzi MPrattichizzo D(2020)Hand closure model for planning top grasps with soft robotic handsInternational Journal of Robotics Research10.1177/027836492094746939:14(1706-1723)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1177/0278364920947469
Wan MGuo HJian W(2020)A Geometric Approach for CAD Models Classification based on Shallow LearningProceedings of the 2020 Conference on Artificial Intelligence and Healthcare10.1145/3433996.3434002(25-29)Online publication date: 23-Oct-2020
https://dl.acm.org/doi/10.1145/3433996.3434002
Chan T(2020)Tree Drawings RevisitedDiscrete & Computational Geometry10.1007/s00454-019-00106-w63:4(799-820)Online publication date: 1-Jun-2020
https://dl.acm.org/doi/10.1007/s00454-019-00106-w
Xue JLi YJanardan R(2019)On the expected diameter, width, and complexity of a stochastic convex hullComputational Geometry: Theory and Applications10.1016/j.comgeo.2019.04.00282:C(16-31)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1016/j.comgeo.2019.04.002
Kyng RPeng RSchwieterman RZhang PDiakonikolas IKempe DHenzinger M(2018)Incomplete nested dissectionProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188960(404-417)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188960
Campi SGritzmann PGronchi P(2018)On the Reverse Loomis---Whitney InequalityDiscrete & Computational Geometry10.1007/s00454-017-9949-960:1(115-144)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s00454-017-9949-9
Xie XLuo SFeng J(2017)A general framework for 3D model co-alignmentComputer-Aided Design10.1016/j.cad.2017.05.00190:C(59-70)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1016/j.cad.2017.05.001
Har-Peled SRoy S(2017)Approximating the Maximum Overlap of Polygons under TranslationAlgorithmica10.1007/s00453-016-0152-978:1(147-165)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1007/s00453-016-0152-9
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents