·2,447,543篇论文数据，部分数据来源于NoteExpress
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
第四，利用闭凸包收缩原理和特征空间分离度量方法对决策树多类分类算法进行了改进。
Via abstracting this pre-information, the blindness of choosing the classifier can be reduced and existing method of multi-classification can be advanced to improve their accuracy of classification.
然后进一步详细地给出了一种改进的求平面任意散乱点集凸包的新算法。
The purpose of step is to partition planar point set and to simplify the calculation distance from a point to a straight line.
应用推荐