Vertex Correspondence for Compatible Convex Decompositions between Polygons

A. Dharmaratne and K. Harada (Japan)


Vertex Correspondence, Compatible Convex Decomposition, Convex Polygons, Shape Blending.


This paper presents an algorithm to establish a correspon dence between the vertices of a pair of polygons. The proposed technique establishes a vertex correspondence between two polygons by inserting new vertices regardless of the locations, orientations, sizes, shapes, or number of vertices of the polygons. These new vertices can be either inserted at the existing vertices, or they can be inserted along the corresponding edges of the polygons. After establishing a successful correspondence between the vertices, the pair of polygons are decomposed into convex sub polygons constructing a compatibility between the decomposed parts. Such a compatible representation between objects are applicable in various techniques such as morphing, warping and blending one shape into another. The vertex correspondence itself is also useful in the areas of pattern recognition and surface reconstruction. The ap plications in computer animation and shape representation and analysis benefit much from these techniques since establishing correspondence and compatibility play major roles in object representation.

Important Links:

Go Back