Abstract: It is important to solve the multiply connected region graph matching problem in engineering drawings recognition and interpretation, which is compounded by multi-polygon. First, the multiply connected region graph is represented by encircle polygon and connected polygon; then, the position problem of included connectivity is solved by achieving triangulation according to short-distance, non-cover and including principles. In the matching process, first the contour is positioned by matching encircle polygon, and then the connected region is removed successfully by matching connected polygon, at last the rotated and scaled graphics matching problem is accomplished by shrinking the graphics region step by step. This method has been applied in the automobile wire harness drawing recognition and makes good effect.

Key words: computer application, graphics matching, multiply connected region graph, triangulation, connected polygon, included connectivity