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

图学学报

• 智能设计与数字化设计 • 上一篇    下一篇

区域填充算法在多重嵌套多边形图形中的应用

  

  1. 闽南师范大学计算机学院,福建 漳州 363000
  • 出版日期:2018-04-30 发布日期:2018-04-30
  • 基金资助:
    福建省教育厅中青年教师科研项目(JAT160290)

Application of Region Filling Algorithm in Multi Nested Polygon Graph

  1. Computer College, Minnan Normal University, Zhangzhou Fujian 363000, China
  • Online:2018-04-30 Published:2018-04-30

摘要: 区域填充算法在制图中有着广泛的应用,但目前对任意多个多边形相互嵌套的区
域填充算法很难实现,为此提出一种基于等间距平行线的区域填充算法。首先,按一定的间隔
绘制一组平行线;其次,计算所有平行线与任意嵌套的多边形的交点;最后,以间隔值作为子
块大小的参数,计算每条平行线所包含的子块个数及坐标值并填充,最终完成整个区域填充。
在实验的过程中解决了如何准确计算相互嵌套的多边形同时与平行线都有交点的问题。通过自
主设计的应用程序验证多组数据,表明该算法能快速准确地完成任意数量的多边形相互嵌套的
区域填充并对实验过程中的技术难点和算法复杂度做了分析。

关键词: 等间距平行线, 内点, 多重嵌套, 区域填充, 子块

Abstract: Region filling algorithm is widely used in drawing, but the arbitrary polygon nested region
filling algorithm is very difficult to achieve, in order to solve this problem, puts forward new area
filling algorithm that based on equidistant parallel lines. Firstly, draw a set of parallel lines use the
same intervals. Secondly, calculation the intersection that all parallel lines with arbitrary nesting the
polygon. Finally, use the interval value as a parameter sub block of size, each line contains the
parallel calculation of the number of blocks and coordinates and filling, completion of the entire
region filling at last. In the process of the experiment, solve the problem of computing in intersection
of the nested polygons with the parallel lines is solved. Use multi group data through the application
of independent design show that the algorithm can quickly and accurately complete any number of
nested polygon area filling and explain the technical difficulties and algorithm complexity which arise
in the process of experiment.

Key words: equal spaced parallel lines, interior point, multiple nesting, area filling, sub block