Title

Computing 3D shape guarding and star decomposition

Document Type

Article

Publication Date

1-1-2011

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.

Publication Source (Journal or Book title)

Computer Graphics Forum

First Page

2087

Last Page

2096

This document is currently not available here.

COinS