The Search is performed on all of the following fields:
Note: Please use complete words only.

Publication Title

Abstract

Publication Keywords

DOI

Proceeding Title

Proceeding Foreword

ISBN (Completed)

Insticc Ontology

Author Affiliation

Author Name

Editor Name

If you're looking for an exact phrase use quotation marks on text fields.

Paper

EXPERIMENTAL STUDY OF BOUNDING BOX ALGORITHMSTopics: Collision Detection; Fundamental Methods and Algorithms; Geometric Computing; Modeling and Algorithms

Keyword(s):Bounding Box Algorithms, Principal Component Analysis, Approximation Algorithms.

Related
Ontology
Subjects/Areas/Topics:Collision Detection
;
Computer Vision, Visualization and Computer Graphics
;
Fundamental Methods and Algorithms
;
Geometric Computing
;
Geometry and Modeling
;
Interactive Environments
;
Modeling and Algorithms

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.(More)

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.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Dimitrov D.; Holst M.; Knauer C.; Kriegel K. and (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

@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}, }

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