EXPERIMENTAL STUDY OF BOUNDING BOX ALGORITHMS

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

Abstract

The computation of the minimum-volume bounding box of a point set in R3 is a hard problem. The best known exact algorithm requires O(n3 ) time, so several approximation algorithms and heuristics are preferred in practice. Among them, the algorithm based on PCA (Principal Component Analysis) plays an important role. Recently, it has been shown that the discrete PCA algorithm may fail to approximate the minimum-volume bounding box even for a large constant factor. Moreover, this happens only for some very special examples with point clusters. As an alternative, it has been proven that the continuous version of PCA overcomes these problems. Here, we study the impact of the recent theoretical results on applications of several PCA variants in practice. We give the closed form solutions for the case when the point set is a polyhedron or a polyhedral surface. To the best of our knowledge, the continuous PCA over the volume of a 3D body is considered for the first time. We analyze the advantages and disadvantages of the different variants on realistic inputs, randomly generated inputs, and specially constructed (worst case) instances. The results reveal that for most of the realistic inputs the qualities of the discrete PCA and the continuous PCA bounding boxes are comparable. As it was expected the discrete PCA versions are much faster, but behave bad on the clustered inputs. In addition, we evaluate and compare the performances of several existing bounding box algorithms.

References

  1. Barequet, G., Chazelle, B., Guibas, L. J., Mitchell, J. S. B., and Tal, A. (1996). Boxtree: A hierarchical representation for surfaces in 3D. Computer Graphics Forum, 15:387-396.
  2. Barequet, G. and Har-Peled, S. (2001). Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J. Algorithms, 38(1):91-109.
  3. Beckmann, N., Kriegel, H.-P., Schneider, R., and Seeger, B. (1990). The R¤-tree: An efficient and robust access method for points and rectangles. ACM SIGMOD Int. Conf. on Manag. of Data, pages 322-331.
  4. Dimitrov, D., Knauer, C., Kriegel, K., and Rote, G. (2007a). New upper bounds on the quality of the PCA bounding boxes in R2 and R3. In Proc. 23rd Annu. ACM Sympos. on Comput. Geom., pages 275-283.
  5. Dimitrov, D., Knauer, C., Kriegel, K., and Rote, G. (2007b). Upper and lower bounds on the quality of the PCA bounding boxes. In Proc. 15th WSCG, pages 185- 192.
  6. Gottschalk, S., Lin, M. C., and Manocha, D. (1996). OBBTree: A hierarchical structure for rapid interference detection. In SIGGRAPH 1996, pages 171-180.
  7. Har-Peled, S. (2001). A practical approach for computing the diameter of a point-set. In Proc. 17th Annu. ACM Sympos. on Comput. Geom., pages 177-186.
  8. Jolliffe, I. (2002). Principal Component Analysis. SpringerVerlag, New York, 2nd ed.
  9. Lahanas, M., Kemmerer, T., Milickovic, N., K. Karouzakis, D. B., and Zamboglou, N. (2000). Optimized bounding boxes for three-dimensional treatment planning in brachytherapy. In Med. Phys. 27, pages 2333-2342.
  10. Macbeath, A. M. (1951). A compactness theorem for affine equivalence classes of convex regions. Canadian J. Math., 3:54-61.
  11. O'Rourke, J. (1985). Finding minimal enclosing boxes. In Int. J. Comp. Info. Sci. 14, pages 183-199.
  12. Roussopoulos, N. and Leifker, D. (1985). Direct spatial search on pictorial databases using packed R-trees. In ACM SIGMOD, pages 17-31.
  13. Sellis, T., Roussopoulos, N., and Faloutsos, C. (1987). The R+-tree: A dynamic index for multidimensional objects. In 13th VLDB Conference, pages 507-518.
  14. Toussaint, G. (1983). Solving geometric problems with the rotating calipers. In IEEE MELECON, pages A10.02/1-4.
  15. Vranic, D. V., Saupe, D., and Richter, J. (2001). Tools for 3D-object retrieval: Karhunen-Loeve transform and spherical harmonics. In IEEE 2001 Workshop Multimedia Signal Processing, pages 293-298.
Download


Paper Citation


in Harvard Style

Dimitrov D., Holst M., Knauer C. and Kriegel K. (2008). EXPERIMENTAL STUDY OF BOUNDING BOX ALGORITHMS . In Proceedings of the Third International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2008) ISBN 978-989-8111-20-3, pages 15-22. DOI: 10.5220/0001096600150022


in Bibtex Style

@conference{grapp08,
author={Darko Dimitrov and Mathias Holst and Christian Knauer and Klaus Kriegel},
title={EXPERIMENTAL STUDY OF BOUNDING BOX ALGORITHMS},
booktitle={Proceedings of the Third International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2008)},
year={2008},
pages={15-22},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001096600150022},
isbn={978-989-8111-20-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2008)
TI - EXPERIMENTAL STUDY OF BOUNDING BOX ALGORITHMS
SN - 978-989-8111-20-3
AU - Dimitrov D.
AU - Holst M.
AU - Knauer C.
AU - Kriegel K.
PY - 2008
SP - 15
EP - 22
DO - 10.5220/0001096600150022