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.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
This paper discusses the problem of covering an ordered point set by a sequence of rectangles with minimum width in the area of computational geometry.
讨论了计算几何学中的矩形条覆盖问题，提出解决该问题的一个有效算法，并对提出的算法进行了分析。
Convex hull problem is one of the fundamental problems in computational geometry, and is used in many fields.
凸包问题是计算几何的基本问题之一，在许多领域均有应用。
In computational geometry, computing cross products is at the heart of line-segment methods.
叉积是计算几何中关于线段算法的核心。
The triangulation of constrained data set is widely used in Geographic Information System (GIS), geo-science, computational geometry, multi-resolution and high precision DTM, et al.
顾及地形特征线的散点域(约束数据域)三角剖分是建立高精度数字地面模型的基础，在GIS、地学分析、计算几何、多分辨率DTM等领域中有着广泛的应用。
By making use of the proximity query method in computational geometry, the whole matching query, pattern query, inverse query and outlier detection in time series are studied.
提出了计算几何应用到时间序列挖掘的方法，实现了时间序列全序列匹配查询、模式查询、反向查询和异常检测，查询效率和准确性都有了比较大的提高。
Triangulation is widely used in geology, computational geometry, graphics, images, and many other science and biomedical and other fields.
三角网剖分技术在地质学、计算几何学、图形图像学和生物医学等众多领域得到广泛的应用。
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.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
应用推荐