loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Darko Dimitrov 1 ; Mathias Holst 2 ; Christian Knauer 1 and Klaus Kriegel 1

Affiliations: 1 Freie Universität Berlin, Institute of Computer Science, Germany ; 2 Universität Rostock, Institute of Computer Science, Germany

ISBN: 978-989-8111-20-3

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 advant ages 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)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 100.24.122.228

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.