求平面点集的凸包是计算几何的一个基本算法。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
平面点集作为一种常见数学模型，其上常做的运算是求其凸包和三角网格。
Two kinds of common operation on the set of nodes in a plane are calculating its convex hull and triangulation, and usually the algorithms are studied independently.
说明：求一个平面点集最近的两点间距离的算法实现，VS 2010编译通过。
Find a planar point set the distance between two points of a recent algorithm, VS2010 compile.
提出了一种解决平面点集最小权三角划分的新方法——最小权三角划分进化算法。
A new algorithm for the minimum weight triangulation (MWT) of points on a plane, called evolutive minimum weight triangulation (EMWT), is presented.
提出了一种计算海量平面点集凸壳的快速近似算法——点集坐标旋转法（PSCR）。
The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set. That is Point Set Coordinate Rotation Algorithm(PSCR).
本文定义了聚类中心以及点到聚类中心的距离，提出了一种平面点集的动态聚类分析方法。
In this paper, cluster centre and the distance from point to the cluster centre was defined, and a dynamic analysis method for plane point set was put forword.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
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.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
针对平面点集最小权三角划分问题的特点，提出了新的交叉算子和变异算子，即多边形交叉算子与三角形变异算子。
Based on the characteristic of MWT problem, new operators for crossover and mutation are presented, that is, polygon crossover and triangular mutation.
针对平面点集最小权三角划分问题的特点，提出了新的交叉算子和变异算子，即多边形交叉算子与三角形变异算子。
Based on the characteristic of MWT problem, new operators for crossover and mutation are presented, that is, polygon crossover and triangular mutation.
应用推荐