Convex Skeleton Construction for Polygon Morphing

A. Dharmaratne and K. Harada (Japan)


Compatible convex decomposition, Linear interpolation, Convex skeleton, Vertex Correspondence


We present a method for smoothly transforming a two dimensional polygon into another in linear time. First, we decompose the two polygons into compatible convex sub-polygons such that there exists a one-to-one mapping between them. This step establishes a correspondence be tween the two polygons and a new polygon representation scheme called the convex skeleton is introduced. Then, the two convex skeletons are interpolated to produce a smooth transition between the polygons. Vertex Correspondence between two polygons is also discussed.

Important Links:

Go Back