This paper presents a new polygon filling algorithm based on vertex storage types.
提出了一种基于顶点存储类型的多边形填充算法。
This paper extends the concept of monotone chain in computational geometry. It presents a new polygon scanning fill algorithm, polygon filling algorithm based on monotony chain.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
A fast polygon - filling algorithm named the improved edge flag algorithm is described in detail in this paper.
本文详细描述了一种快速多边形填充算法——改进的边标志算法。
An algorithm of filling convex polygon is provided in order to construct real-body model fast.
本文就快速构成实体模型，提出一种有效的凸多边形填充算法。
Traditional scan-line Polygon-Filling Algorithm can only deal with horizontal scan-lines and can only fill a polygon line by line.
传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充。
At the same time in the polygon filling process , the Graham algorithm is used to determine the polygon vertex order.
同时在对多边形填充过程中使用了凸包算法，解决确定多边形顶点顺序问题。
Base on the research for the algorithm, which have had, of filling up polygon, Authors give a new algorithm, to be known as "the algorithm to calculate points of intersection with completely memory".
作者在对已有的多边形填充算法深入研究的基础上，给出了一种称之为“完全记忆求交法”的新的多边形填充算法。新算法较已有算法有更高的效率。
Base on the research for the algorithm, which have had, of filling up polygon, Authors give a new algorithm, to be known as "the algorithm to calculate points of intersection with completely memory".
作者在对已有的多边形填充算法深入研究的基础上，给出了一种称之为“完全记忆求交法”的新的多边形填充算法。新算法较已有算法有更高的效率。
应用推荐