Variational 3D Shape Segmentation for Bounding Volume Computation
Authors:
- 1 September 2007
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 26 (3) , 329-338
Abstract
We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e‐tightness, the resemblance to ellipsoid, a novel functional is formulated that governs an optimization process to obtain a partition with multiple components. Refinement of segmentation is driven by application‐specific error measures, so that the final bounding volume meets pre‐specified user requirement. We present examples to demonstrate the effectiveness of our method and show that it works well for computing ellipsoidal bounding volumes as well as oriented bounding boxes.Keywords
This publication has 24 references indexed in Scilit:
- Variational sphere set approximation for solid objectsThe Visual Computer, 2006
- Adaptive medial-axis approximation for sphere-tree constructionACM Transactions on Graphics, 2004
- Hierarchical mesh decomposition using fuzzy clustering and cutsACM Transactions on Graphics, 2003
- The power crust, unions of balls, and the medial axis transformComputational Geometry, 2001
- Centroidal Voronoi Tessellations: Applications and AlgorithmsSIAM Review, 1999
- Efficient collision detection using bounding volume hierarchies of k-DOPsIEEE Transactions on Visualization and Computer Graphics, 1998
- BOXTREE: A Hierarchical Representation for Surfaces in 3DComputer Graphics Forum, 1996
- Approximating polyhedra with spheres for time-critical collision detectionACM Transactions on Graphics, 1996
- Unsupervised optimal fuzzy clusteringIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982