A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism

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 proc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Science China Technological Sciences 2011-07, Vol.54 (7), p.1826-1832
Hauptverfasser: Huang, Rui, Zhang, ShuSheng, Fan, HaiTao, Tao, Jun
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1674-7321
1869-1900
1862-281X
DOI:10.1007/s11431-011-4386-0