... 平面钝化晶体管 planar passivated transistor 平面点集 planar point set 平面处理 planar process ...
基于16个网页-相关网页
In this paper,A new parallel algorithm was proposed by combining improved fast convex hull algorithm of planar point set based on sorted simple polygon in this paper. The worst-case time complexity of the algorithm was O(n).
提出了在基于有序简单多边形的平面点集凸包快速求取算法基础上改进的并行算法,该算法的时间复杂度达到了O(n)。
参考来源 - 平面点集凸包的并行算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set. That is Point Set Coordinate Rotation Algorithm(PSCR).
提出了一种计算海量平面点集凸壳的快速近似算法——点集坐标旋转法（PSCR）。
应用推荐