To meet the urgent requirement of enterprises for three-dimensional (3D) process models, an approach based on subgraph isomorphism is proposed to solve the matching problem between precursory 3D process model and 2D w...To meet the urgent requirement of enterprises for three-dimensional (3D) process models, an approach based on subgraph isomorphism is proposed to solve the matching problem between precursory 3D process model and 2D working procedure drawings. First, the projection drawings of the precursory 3D process model are obtained, then the primitives are extracted and the attributed adjacency graph (AAG) is constructed. Finally, by taking the 2D working procedure drawing as the AAG, and the projection drawing as the whole AAG, the matching problem between precursory 3D process model and 2D working procedure drawings is translated into the problem of subgraph isomorphism. To raise the matching efficiency, the AAG is partitioned, and the vertexes of the graph are classified effectively using the vertex’s attributes. Experimental results show that this method is able to support exact match and the matching efficiency can meet the requirement of practical applications.展开更多
基金supported by the National Natural Science Foundation of China (Grant No. 51075336)the National High Technology Research and Development Program of China (Grant No. 2007AA04Z137)
文摘To meet the urgent requirement of enterprises for three-dimensional (3D) process models, an approach based on subgraph isomorphism is proposed to solve the matching problem between precursory 3D process model and 2D working procedure drawings. First, the projection drawings of the precursory 3D process model are obtained, then the primitives are extracted and the attributed adjacency graph (AAG) is constructed. Finally, by taking the 2D working procedure drawing as the AAG, and the projection drawing as the whole AAG, the matching problem between precursory 3D process model and 2D working procedure drawings is translated into the problem of subgraph isomorphism. To raise the matching efficiency, the AAG is partitioned, and the vertexes of the graph are classified effectively using the vertex’s attributes. Experimental results show that this method is able to support exact match and the matching efficiency can meet the requirement of practical applications.
