Variational 3D Shape Segmentation for Bounding Volume Computation

Simple item page
dc.contributor.authorLu, Linen_US
dc.contributor.authorChoi, Yi-Kingen_US
dc.contributor.authorWang, Wenpingen_US
dc.contributor.authorKim, Myung-Sooen_US
dc.date.accessioned2015-02-21T15:41:33Z
dc.date.available2015-02-21T15:41:33Z
dc.date.issued2007en_US
dc.description.abstractWe 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume26en_US
dc.identifier.doi10.1111/j.1467-8659.2007.01055.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages329-338en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2007.01055.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleVariational 3D Shape Segmentation for Bounding Volume Computationen_US
Files
Collections
26-Issue 3