搜索资源列表
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
Spline
- 根据（0.0,0.0）（0.5,1.6）（1.0,2.0）（6.0,2.0）（7.0,1.5）（9.0,0.0）六个点使用三次样条差值求多项式并作图-According to (0.0,0.0) (0.5,1.6) (1.0,2.0) (6.0,2.0) (7.0,1.5) (9.0,0.0) using cubic spline six point margin and a polynomial mapping
Numerical-Analysis-for-Statisticians
- Java常用数值算法集 共有数值计算中常用的Java方法近200个．内容包括：解线性代数方程组、插值、数值积分、特殊函数、函数逼近、随机数、排序、特征值问题、数据拟合、方程求根和非线性方程组求解、函数的极值和最优化、数据的统计描述、傅里叶变换谱方法、解常微分方程组、两点边值问题的解法和解偏微分方程组．-Java common set numerical algorithm the total numerical calculation commonly used Java method
PRJ_Final
- K-mean Algorithm Initialisation: set seed points Assign each object to the cluster with the nearest seed point Compute seed points as the centroids of the clusters of the current partition (the centroid is the centre, i.e., mean point, of th
ClosestPairPoint
- 最近点对算法的实现，用java编写，可以直接使用-The nearest point on the implementation of the algorithm, using java, you can directly use