Premium
Variational 3D Shape Segmentation for Bounding Volume Computation
Author(s) -
Lu Lin,
Choi YiKing,
Wang Wenping,
Kim MyungSoo
Publication year - 2007
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2007.01055.x
Subject(s) - bounding overwatch , ellipsoid , bounding volume , minimum bounding box , computer science , computation , affine transformation , segmentation , volume (thermodynamics) , invariant (physics) , partition (number theory) , process (computing) , artificial intelligence , mathematical optimization , algorithm , mathematics , geometry , image (mathematics) , combinatorics , physics , computer security , quantum mechanics , astronomy , collision detection , mathematical physics , collision , operating system
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.