Yu, WuyiLi, XinBing-Yu Chen, Jan Kautz, Tong-Yee Lee, and Ming C. Lin2015-02-272015-02-2720111467-8659https://doi.org/10.1111/j.1467-8659.2011.02056.xThis 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