Polyhedron realization for shape transformation

Polyhedron realization is the transformation of a polyhedron into a convex polyhedron with an isomorphic vertex neighborhood graph. We present in this paper a novel algorithm for polyhedron realization, which is general, practical, efficient, and works for any zero–genus polyhedron. We show how the algorithm can be used for finding a correspondence for shape transformation. After the two given polyhedra are being realized, it is easy to merge their vertex–neighborhood graphs into a common graph. This graph is then induced back onto the original polyhedra. The common vertex–neighborhood graph allows the interpolation of the corresponding vertices. Key words: Shape transformation, metamorphosis, correspondence, polyhedron realization.

• Type: Journal
• Year: 1998
• Where: VC
• Authors: Avner Shapiro, Ayellet Tal
• Keywords: Convex Polyhedron, Polyhedron, Polyhedron Realization, VC 1998