Computing 3D Shape Guarding and Star Decomposition

This paper proposes an effective framework to compute the vi sibility guarding and star decomposition of 3D solid shapes. We propose a progressive integer linear programmin g algorithm to solve the guarding points that can visibility cover the entire shape; we also develop a constra ined region growing scheme seeded on these guarding points to get the star decomposition. We demonstrate this gu arding/decomposition framework can benefit graphics tasks such as shape interpolation and shape matching/retri eval.