Sciweavers

CGF
2007

Variational 3D Shape Segmentation for Bounding Volume Computation

13 years 4 months ago
Variational 3D Shape Segmentation for Bounding Volume Computation
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. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling
Lin Lu, Yi-King Choi, Wenping Wang, Myung-Soo Kim
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2007
Where CGF
Authors Lin Lu, Yi-King Choi, Wenping Wang, Myung-Soo Kim
Comments (0)