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.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
Based on the analysis of the existing algorithm of MAC address forwarding table, it presents a kind of new physical topology discovery algorithm depended on spanning tree protocol.
在分析原有基于MAC地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
The paper presents a new algorithm which is named Generalized Simplex Algorithm. It is an extended algorithm of the Simplex Algorithm.
提出了一个新算法，取名为广义单纯形算法，它可被看作是单纯形法的扩展算法。
应用推荐