A 2D Engineering Drawing and 3D Model Matching Algorithm for Process Plant

被引:5
作者
Wen, Rui [1 ]
Tang, Weiqing [2 ]
Su, Zhiyong [3 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing, Jiangsu, Peoples R China
[2] Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
[3] Nanjing Univ Sci & Technol, Sch Automat, Nanjing, Jiangsu, Peoples R China
来源
2015 5TH INTERNATIONAL CONFERENCE ON VIRTUAL REALITY AND VISUALIZATION (ICVRV 2015) | 2015年
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
process plant; 3D model; 2D engineering drawing; matching calculation; graph similarity; CAPD MODELS;
D O I
10.1109/ICVRV.2015.13
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Process plant Computer-Aided Design (CAD) models can be roughly divided into 3D models and 2D engineering drawings. Matching calculation of these CAD models not only contributes to their coherency verification, but also benefits for the development of model retrieval. However, in process plant area, 3D models and 2D engineering drawings are different in both graphical representations and content structures, which leads to the inapplicability of current shape-feature based 2D & 3D matching approaches. To resolve this problem, a topological structure based algorithm is proposed. Exploiting component as the basic unit, we firstly transform 2D engineering drawings and 3D models into attribute graphs. Then, by introducing related researches of graph similarity, we calculate attribute graph similarity to measure the matching degree between their corresponding CAD models. The proposed algorithm is translation, rotation and similarity transformation consistent. Experimental results demonstrate its effectiveness and feasibility.
引用
收藏
页码:154 / 159
页数:6
相关论文
共 13 条
  • [1] Approximation of graph edit distance based on Hausdorff matching
    Fischer, Andreas
    Suen, Ching Y.
    Frinken, Volkmar
    Riesen, Kaspar
    Bunke, Horst
    [J]. PATTERN RECOGNITION, 2015, 48 (02) : 331 - 343
  • [2] A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism
    Huang Rui
    Zhang ShuSheng
    Fan HaiTao
    Tao Jun
    [J]. SCIENCE CHINA-TECHNOLOGICAL SCIENCES, 2011, 54 (07) : 1826 - 1832
  • [3] Huang X., 2002, THESIS
  • [4] A distance measure for large graphs based on prime graphs
    Lagraa, Sofiane
    Seba, Hamida
    Khennoufa, Riadh
    M'Baya, Abir
    Kheddouci, Hamamache
    [J]. PATTERN RECOGNITION, 2014, 47 (09) : 2993 - 3005
  • [5] Liang Li, 2010, 2010 Proceedings of 3rd International Congress on Image and Signal Processing (CISP 2010), P1586, DOI 10.1109/CISP.2010.5646952
  • [6] Rao S., 2006, THESIS
  • [7] RASCAL: Calculation of graph similarity using maximum common edge subgraphs
    Raymond, JW
    Gardiner, EJ
    Willett, P
    [J]. COMPUTER JOURNAL, 2002, 45 (06) : 631 - 644
  • [8] Stephan Matthew, 2013, MODELSWARD 2013. 1st International Conference on Model-Driven Engineering and Software Development. Proceedings, P265
  • [9] Topology authentication for CAPD models based on Laplacian coordinates
    Su, Zhiyong
    Zhou, Lang
    Li, Weiqing
    Dai, Yuewei
    Tang, Weiqing
    [J]. COMPUTERS & GRAPHICS-UK, 2013, 37 (04): : 269 - 279
  • [10] Watermarking 3D CAPD models for topology verification
    Su, Zhiyong y
    Li, Weiqing
    Kong, Jianshou
    Dai, Yuewei
    Tang, Weiqing
    [J]. COMPUTER-AIDED DESIGN, 2013, 45 (07) : 1042 - 1052