欢迎访问《图学学报》 分享到:

图学学报

• 计算机图形学与应用 • 上一篇    下一篇

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

  

  • 出版日期:2010-02-26 发布日期:2015-08-11

Research on Graphics Matching of Multiply Connected Region Based on Triangulation

  • Online:2010-02-26 Published:2015-08-11

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

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

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