Computing 3D Shape Guarding and Star Decomposition

Simple item page
dc.contributor.authorYu, Wuyien_US
dc.contributor.authorLi, Xinen_US
dc.contributor.editorBing-Yu Chen, Jan Kautz, Tong-Yee Lee, and Ming C. Linen_US
dc.date.accessioned2015-02-27T16:14:12Z
dc.date.available2015-02-27T16:14:12Z
dc.date.issued2011en_US
dc.description.abstractThis paper proposes an effective framework to compute the visibility guarding and star decomposition of 3D solid shapes. We propose a progressive integer linear programming algorithm to solve the guarding points that can visibility cover the entire shape; we also develop a constrained region growing scheme seeded on these guarding points to get the star decomposition. We demonstrate this guarding/decomposition framework can benefit graphics tasks such as shape interpolation and shape matching/retrievalen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.doi10.1111/j.1467-8659.2011.02056.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2011.02056.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleComputing 3D Shape Guarding and Star Decompositionen_US
Files
Collections
30-Issue 7