A face based algorithm for matching two line drawings of a polyhedron

An algorithm to match two line drawings of a polyhedron is presented. During the matching process, a vertex-edge code (VE code) is assigned to each visible face, which can distinguish between faces according to their 2-D and 3-D features. The matching is confined between those faces which have the same VE code, and thus has a great reduction in searching area and computation time. Experimental results have shown that the algorithm works well under variance of distortions caused by the moving objects