... 平面钝化晶体管 planar passivated transistor 平面点集 planar point set 平面处理 planar process ...
基于28个网页-相关网页
...平面点集;平面曲线;几何应用;复数方法;麦比乌斯变换 [gap=719]Keywords:Complex numbers; Complex numbers operation; Collected points on the level; Curves on the level ; Geometric application; Complex numbers’ methods; Mobius ..
基于12个网页-相关网页
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)。
参考来源 - 平面点集凸包的并行算法研究This paper study the triangulation for a scattered point set in the plane.
本文针对平面点集的三角剖分进行研究。
参考来源 - 基于flip的Delaunay三角剖分算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
求平面点集的凸包是计算几何的一个基本算法。
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.
应用推荐