首页 | 本学科首页   官方微博 | 高级检索  
     

基于矢量游走的任意非自交图形合并算法
引用本文:刘术华,周云燕,曹立强,万里兮. 基于矢量游走的任意非自交图形合并算法[J]. 计算机工程与设计, 2012, 33(1): 186-191
作者姓名:刘术华  周云燕  曹立强  万里兮
作者单位:中国科学院微电子研究所,北京,100029
摘    要:图形处理软件中,常常需要将许多非自交图形合并成一个图形,提出一种基于矢量游走的任意非自交多边形合并算法,提出了适合于多边形合并运算的改进矢量游走规则及交点转移条件.通过将交点和两相交矢量边联合处理,对交点分类,有效地去除了“伪交点”,进而简化了重合交点处理.提出用带凸度线段的方式来表示圆和舍圆弧边的多边形,成功地将矢量游走规则运用到这些复杂多边形的快速合并当中.

关 键 词:多边形  带孔多边形  矢量游走  合并运算  重合顶点  凸度

Non-self-intersection graphics combination algorithm based on vector wander method
LIU Shu-hua , ZHOU Yun-yan , CAO Li-qiang , WAN Li-xi. Non-self-intersection graphics combination algorithm based on vector wander method[J]. Computer Engineering and Design, 2012, 33(1): 186-191
Authors:LIU Shu-hua    ZHOU Yun-yan    CAO Li-qiang    WAN Li-xi
Affiliation:(Institute of Microelectronics,Chinese Academy of Sciences,Beijing 100029,China)
Abstract:Non-self-intersection graphics are needed to merge into one graphic,which is commonly used in graphics processing software.An inner hole polygon combination algorithm based on vector wander method is introduced,and the related rules and converge shift conditions are proposed.The simplification of coincidence intersection processing is proposed by combinational handling the intersection and the intersected vectors,then the intersection is assorted and the fake intersection is eliminated efficiently.The principle of vector wandering is applied to the mergence of the polygons by using convex section of line to indicate circle and polygon with circular arc.
Keywords:polygon  inner hole polygon  vector wander  combination algorithm  coincidence intersection  convexity
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号