陈占龙, 吴亮, 刘焕焕. 基于排序边表的简单要素模型多边形裁剪算法[J]. 微电子学与计算机, 2012, 29(9): 145-148.
引用本文: 陈占龙, 吴亮, 刘焕焕. 基于排序边表的简单要素模型多边形裁剪算法[J]. 微电子学与计算机, 2012, 29(9): 145-148.
CHEN Zhan-long, WU Liang, LIU Huan-huan. Simple Feature Model Polygon Clipper Algorithm Base on Sorting Edges Table[J]. Microelectronics & Computer, 2012, 29(9): 145-148.
Citation: CHEN Zhan-long, WU Liang, LIU Huan-huan. Simple Feature Model Polygon Clipper Algorithm Base on Sorting Edges Table[J]. Microelectronics & Computer, 2012, 29(9): 145-148.

基于排序边表的简单要素模型多边形裁剪算法

Simple Feature Model Polygon Clipper Algorithm Base on Sorting Edges Table

  • 摘要: 为了解决多边形的裁剪效率低的问题,根据多边形的构成特点,提出了一种基于排序边表的鲁棒性较强的裁剪方法.该算法首先利用简单要素类模型,将多边形看成是由一系列的点的坐标组成,然后对点进行处理将多边形的边分成左边界和右边界,利用扫描线算法,对多边形的边进行扫描,然后利用排序边表方法对其求交点,形成最后的结果.实验证明,该方法可以很好的解决大规模的区裁剪问题.

     

    Abstract: To conquer the low efficiency of polygon clipper problem, according to the characteristics of polygon constituting, we proposed a robust polygon clipper algorithm here.This algorithm firstly maked use of simple feature model, considered polygons as a set of cooridinates, disposed the edges to left and right bounds of polygons, used scan beam algorithm scanning polygons, then, computed intersect node with sorting edges tables, and at end we formed the end results.This method can solve the problems of large scale polygons clipper.

     

/

返回文章
返回