Matching perspective views of a polyhedron using circuits

We present a novel approach for finding corresponding points between two line drawings extracted from perspective views of a moving object whose surface is composed of planar polygons. In our approach, each circuit of the drawings is encoded with a boundary shape code which we call the RLCC code (run length code of convex and concave strings), then a clustering technique is used to obtain the matching result recursively. A series of measures are taken to make the algorithm tolerate considerable dissimilarities which may exist between the two drawings, such as missing lines, scale differences, rotation, perspective shape distortions, etc. Experimental results are presented.