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 a novel algorithm for polyhedron realization that 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 realized, it is easy to merge their vertex-neighborhood graphs into a common graph. This graph is then induced back onto the origi nal polyhedra. The common vertex-neighborhood graph allows the interpolatio n of the corresponding vertices.