| dc.contributor.author | Yu, Wuyi | en_US |
| dc.contributor.author | Li, Xin | en_US |
| dc.contributor.editor | Bing-Yu Chen, Jan Kautz, Tong-Yee Lee, and Ming C. Lin | en_US |
| dc.date.accessioned | 2015-02-27T16:14:12Z | |
| dc.date.available | 2015-02-27T16:14:12Z | |
| dc.date.issued | 2011 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.2011.02056.x | en_US |
| dc.description.abstract | This 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/retrieval | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Computing 3D Shape Guarding and Star Decomposition | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
