基于三角划分的多连通域图形匹配研究  

Research on Graphics Matching of Multiply Connected Region Based on Triangulation

作　　者：刘晓平[1] 何士双[1] 

机构地区：[1]合肥工业大学计算机与信息学院VCC研究室,安徽合肥230009

出　　处：《工程图学学报》2010年第1期61-66,共6页Journal of Engineering Graphics

基　　金：国家自然科学基金资助项目(60673028)

摘　　要：由若干个多边形通过组合产生的具有多个连通域的多连通域图形识别问题是工程图纸识别与理解所要解决的重要问题。首先,通过建立包围多边形、连通多边形概念,完成对多连通域图形的表示;然后,依据最近距离、无遮挡、包含原则添加辅助线,实现三角划分,解决了包含连通的定位问题。在匹配过程中,首先通过匹配包围多边形实现多连通域图形的外轮廓定位;然后通过匹配连通多边形删除连通域,逐步收缩图形,实现图形匹配。应用此方法,解决了多连通域图形的旋转、缩放匹配问题,在汽车线束图纸识别中取得了良好的应用效果。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...

关 键 词：计算机应用 图形匹配 多连通域图形 三角划分 连通多边形 包含连通 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]