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.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
The obtained results can not only been applied to the design and implementation of algorithm for avoidance obstacle path planning, but also been used to solve the problems of computational geometry.
取得的结果不仅可直接应用于避障路径规划算法的设计与实现，而且还可应用于计算几何中相关问题的求解。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
This paper presents a coverage-enhancing algorithm for non-isomorphic node network based on virtual force, which consists of computational geometry and improved virtual force algorithm.
该文提出一种基于虚拟力的异构节点网络覆盖增强算法，该算法由计算几何和改进的虚拟力算法组成。
The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
应用推荐