Fast oriented bounding box optimization on the rotation group SO(3,ℝ)

ACM Transactions on Graphics

Volumn 30, Issue 5, 2011, Pages

  Chang, Chia Tche ^a   Gorissen, Bastien ^a   Melchior, Samuel ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Bounding box; Computational geometry; Manifolds; Optimization

Indexed keywords

BOUNDING BOX; EXACT ALGORITHMS; HYBRID METHOD; NELDER-MEAD ALGORITHMS; ORIENTED BOUNDING BOX; ROTATION GROUP; UNCONSTRAINED OPTIMIZATION PROBLEMS;

ALGORITHMS; COMPUTATIONAL GEOMETRY; OPTIMIZATION; ROTATION;

GLOBAL OPTIMIZATION;

EID: 79955643684     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/2019627.2019641     Document Type: Article

References (44)

1. AGARWAL, P., HAR-PELED, S., AND VARADARAJAN, K. 2004. Approximating extent measures of points. J. ACM 51, 4, 606-635.
2. ASSARSSON, U. AND MÖLLER, T. 2000. Optimized view frustum culling algorithms for bounding boxes. J. Graph. GPU Game Tools 5, 1, 9-22.
3. BAREQUET, G., CHAZELLE, B., GUIBAS, L., MITCHELL, J., AND TAL, A. 1996. BOXTREE: A hierarchical representation for surfaces in 3D. Comput. Graph. Forum. 15, 3, 387-396.
4. BAREQUET, G. AND HAR-PELED, S. 2001. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J. Algor. 38, 1, 91-109. (Pubitemid 33667202)
5. BORCKMANS, P. B. AND ABSIL, P.-A. 2010. Oriented bounding box computation using particle swarm optimization. In Proceedings at the European Symposium on Artificial Neural Networks (ESANN'10). 345-350.
6. CHAN, T. 2006. Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. Theory Appl. 35, 1-2, 20-35.
7. CHELOUAH, R. AND SIARRY, P. 2003. Genetic and nelder-mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. Euro. J. Oper. Res. 148, 2, 335-348.
8. CONN, A. R., GOULD, N. I. M., AND TOINT, P. L. 2000. Trust Region Methods. SIAM, Philadelphia, PA.
9. CONN, A. R., SCHEINBERG, K., AND VICENTE, L. N. 2009. Introduction to Derivative-Free Optimization. SIAM, Philadelphia, PA.
10. DEN BERGEN, G. V. 1998. Efficient collision detectionofcomplex deformable models using AABB trees. J. Graph. Tools 2, 1-13.
11. DIMITROV, D., HOLST, M., KNAUER, C., AND KRIEGEL, K. 2009a. Closed-form solutions for continuous pca and bounding box algorithms. Comput. Vis. Comput. Graph. Theory Appl. 24, 26-40.
12. DIMITROV, D., KNAUER, C., KRIEGEL, K., AND ROTE, G. 2009b. Bounds on the quality of the pca bounding boxes. Comput. Geom. Theory Appl. 42, 8, 772-789.
13. DURAND, N. AND ALLIOT, J.-M. 1999. A combined nelder-mead simplex and genetic algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99). Morgan Kaufmann, 1-7.
14. EDELSBRUNNER, H. AND MAURER, H. A. 1985. Finding extreme points in three dimensions and solving the post-office problem in the plane. Inf. Process. Lett. 21, 1, 39-47. (Pubitemid 15547375)
15. ERICSON, C. 2004. Real-Time Collision Detection (The Morgan Kaufmann Series in Interactive 3-D Technology). Morgan Kaufmann.
16. FREEMAN, H. AND SHAPIRA, R. 1975. Determining the minimum-area encasing rectangle for an arbitrary closed curve. Comm. ACM 18, 7, 409-413.
17. GAMMA GROUP. 2008. 3d meshes research database of the group Génération Automatique de Maillages et Méthodes d'Adaptation, INRIA, France. http://www-roc.inria.fr/gamma/gamma/download/ download. php.
18. GARCIA-ALONSO, A., SERRANO, N., AND FLAQUER, J. 1994. Solving the collision detection problem. IEEE Comput. Graph. Appl. 14, 3, 36-43.
19. GEUZAINE, C. AND REMACLE, J.-F. 2009. Gmsh: a three-dimensional finite element mesh generator with built-in pre-and post-processing facilities. Int. J. Numer. Methods Engin. 79, 1309-1331.
20. GLOVER, F. 1989. Tabu Search-Part I. ORSA J. Comput. 1, 3, 190-206.
21. GLOVER, F. 1990. Tabu Search-Part II. ORSA J. Comput. 2, 1, 4-32.
22. GOLDBERG, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing.
23. GOLUB, G. H. AND VAN LOAN, C. F. 1996. Matrix Computations 3rd Ed. Johns Hopkins University Press.
24. GOTTSCHALK, S., LIN, M. C., AND MANOCHA, D. 1996. Obbtree:a hierarchical structure for rapid interference detection. In Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH96). ACM, New York, 171-180.
25. HOLLAND, J. H. 1975. Adaptation in Natural and Artificial Systems 2nd Ed. University of Michigan Press, Ann Arbor, MI.
26. IONES, A., ZHUKOV, S., AND KRUPKIN, A. 1998. On optimality of obbs for visibility tests for frustum culling, ray shooting and collision detection. In Proceedings of the Computer Graphics International Conference. IEEE Computer Society, Los Alamitos, CA, 256.
27. JIMÉNEZ, P., THOMAS, F., AND TORRAS, C. 2000. 3d collision detection: A survey. Comput. Graph. 25, 269-285. (Pubitemid 32272850)
28. JOLLIFFE, I. T. 2002. Principal Component Analysis. Springer, New York.
29. KELLEY, C. T. 1999. Iterative Methods for Optimization. 18 Frontiers in Applied Mathematics. SIAM, Philadelphia, PA.
30. KIRKPATRICK, S., GELATT, C. D., AND VECCHI, M. P. 1983. Optimization by simulated annealing. Sci. 220, 4598, 671-680.
31. KOLDA, T. G., LEWIS, R. M., AND TORCZON, V. 2003. Optimization by direct search: New perspectives on some classical and modern methods. SIAM Rev. 45, 3, 385-482.
32. KORSAWE, J. 2008. Minimal bounding box. MATLAB Central File Exchange. http://www.mathworks.com/matlabcentral/fileexchange/18264.
33. KRAKOWSKI, K. A., HÜPER, K., AND MANTON, J. H. 2007. On the computation of the karcher mean on spheres and special orthogonal groups. In Proceedings of the Workshop on Robotics and Mathematic (RoboMat'07). 119-124.
34. LAHANAS, M., KEMMERER, T., MILICKOVIC, N., KAROUZAKIS, K., BALTAS, D., AND ZAMBOGLOU, N. 2000. Optimized bounding boxes for three-dimensional treatment planning in brachytherapy. Med. Phys. 27, 10, 2333-2342.
35. MCKINNON, K. 1999. Convergence of the Nelder-Mead simplex method to a nonstationary point. SIAM J. Optimiz. 9, 1, 148-158. (Pubitemid 129489275)
36. NELDER, J. A. AND MEAD, R. 1965. A simplex method for function minimization. Comput. J. 7, 4, 308-313.
37. O'ROURKE, J. 1985. Finding minimal enclosing boxes. Int. J. Comput. Inf. Sci. 14, 183-199.
38. PONAMGI, M. K., MANOCHA, D., AND LIN, M. C. 1997. Incremental algorithms for collision detection between polygonal models. IEEE Trans. Vis. Comput. Graph. 3, 1, 51-64. (Pubitemid 127771580)
39. PREPARATA, F. AND SHAMOS, M. 1985. Computational Geometry: An Introduction. Springer, New York.
40. PRESS, W., TEUKOLSKY, S., VETTERLING, W., AND FLANNERY, B. 1992. Numerical Recipes in C 2nd Ed. Cambridge University Press, Cambridge, UK.
41. REMACLE, J.-F., GEUZAINE, C., COMPÉRE, G., AND MARCHANDISE, E. 2010. High quality surface meshing using harmonic maps. Int. J. Numer. Methods Engin. 83, 403-425.
42. SARLETTE, A. AND SEPULCHRE, R. 2009. Consensus optimization on manifolds. SIAM J. Control Optimiz. 48, 1, 56-76.
43. SHAMOS, M. I. 1978. Computational geometry. Ph. D. thesis, Yale University, New Haven, CT.
44. TOUSSAINT, G. 1983. Solving geometric problems with the rotating calipers. In Proceedings of IEEE MELECON.