A face based algorithm for matching two line drawings of apolyhedron

摘要

An algorithm to match two line drawings of a polyhedron ispresented. During the matching process, a vertex-edge code (VE code) isassigned to each visible face, which can distinguish between facesaccording to their 2-D and 3-D features. The matching is confinedbetween those faces which have the same VE code, and thus has a greatreduction in searching area and computation time. Experimental resultshave shown that the algorithm works well under variance of distortionscaused by the moving objects