Algorithms for a minimum volume enclosing simplex in three dimensions

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1339-1357

  Zhou, Yunhong ^a   Suri, Subhash ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

Bounding volumes; Centroid; Shape approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; SET THEORY;

SHAPE APPROXIMATION;

COMBINATORIAL MATHEMATICS;

EID: 0036588880     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799363992     Document Type: Article

References (23)

1. G.E. Andrews, A lower bound for the volume of strictly convex bodies with many boundary lattice points, Trans. Amer. Math. Soc., 106 (1963), pp. 270-279.
2. G. Barequet and S. Har-Peled, Efficiently approximating the minimum-volume bounding box of a point set in three dimensions, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 1999, ACM, New York, pp. 82-91.
3. J.D. Cohen, M.C. Lin, D. Manocha, and M.K. Ponamgi, I-COLLIDE: An interactive and exact collision detection system for large-scale environments, in Proceedings of the ACM Interactive 3D Graphics Conference, 1995, pp. 189-196.
4. M. Craig, Minimum volume transforms for remotely sensed data, IEEE Trans. Geosci. Remote Sensing, 32 (1994), pp. 542-552.
5. R. Erlich and W. Full, Sorting out geology - unmixing mixtures, in Use and Abuse of Statistical Methods in the Earth Sciences, Oxford University Press, Oxford, UK, 1987, pp. 33-46.
6. D.R. Fuhrmann, A Simplex Shrink-Wrap Algorithm, in Proceedings of SPIE AeroSense, 1999.
7. B. Gärtner and W. Welzl, Linear programming - randomization and abstract frameworks, in Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1064, Springer-Verlag, Berlin, 1996, pp. 669-687.
8. P. Gritzmann and V. Klee, On the complexity of some basic problems in computational convexity: I. Containment problems, Discrete Math., 136 (1994), pp. 129-174.
9. M. Held, J.T. Klosowski, and J.S.B. Mitchell, Collision Detection for Fly-Throughs in Virtual Environments, video presentation at ACM Symposium on Computation Geometry, 1996.
10. P.M. Hubbard, Collision detection for interactive graphics applications, IEEE Trans. Visualization and Computer Graphics, 1 (1995), pp. 218-230.
11. V. Klee, Facet-centroids and volume minimization, Studia Sci. Math. Hungar., 21 (1986), pp. 143-147.
12. V. Klee and M.C. Laskowski, Finding the smallest triangle containing a given convex polygon, J. Algorithms, 6 (1985), pp. 359-366.
13. J.T. Klosowski, M. Held, J.S.B. Mitchell, H. Sowizral, and K. Zikan, Efficient collision detection using bounding volume hierarchies of k-DOPs, IEEE Trans. Visualization and Computer Graphics, 4 (1998), pp. 21-36.
14. J.-C. Latombe, Robot Motion Planning, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.
15. 3 and related problems, SIAM J. Comput., 12 (1983), pp. 759-776.
16. M.P. Moore and J. Wilhelms, Collision detection and response for computer animation, Comput. Graph., 22 (1998), pp. 289-298.
17. J. O'Rourke, A. Aggarwal, S. Maddila, and M. Baldwin, An optimal algorithm for finding minimal enclosing triangle, J. Algorithms, 7 (1986), pp. 258-269.
18. J. O'Rourke, Finding Minimal Enclosing Tetrahedra, Technical Report JHU 84/05, Johns Hopkins University, Baltimore, MD, 1984.
19. J. O'Rourke, Finding minimal enclosing boxes, Internat. J. Comput. Inform. Sci., 14 (1985), pp. 183-199.
20. R. Renner, The resolution of a compositional data into mixtures of fixed source compositions, Appl. Stat., 42 (1993), pp. 615-631.
21. S. Suri, P.M. Hubbard, and J. Hughes, Analyzing bounding boxes for object intersection, ACM Trans. Graphics, 18 (1999), pp. 257-277.
22. G. Vegter and C. Yap, Minimal circumscribing simplices, in Proceedings of the 3rd Canadian Conference on Computational Geometry, Vancouver, Canada, 1991, pp. 58-61.
23. Y. Zhou and S. Suri, Analysis of a bounding box heuristic for object intersection, J. ACM, 46 (1999), pp. 833-857.