搜索资源列表
Voronoi
- 泰森多边形生成算法，先生成Delaunay三角形，再生成其对偶图泰森多边形；图形界面 MFC.-Tyson polygon generation algorithm, sir into Delaunay triangle, into its dual figure regeneration tyson polygon Graphical interface MFC.
POLYCRYSTALLINE-Vornoni
- voronoi的生成算法，使用ＶＣ＋＋语言编程 voronoi的生成算法，使用ＶＣ＋＋语言编程-voronoi VC++voronoi VC++voronoi VC++voronoi VC++voronoi VC++
fffortuneo
- fortune扫描线算法生成voronoi图的演示代代码，可以动态观察算法运行，对原理的理解有很大的帮助！ -fortune scan line algorithm to generate voronoi diagram demonstrates the generation of code, you can dynamically observe the algorithm run on the understanding of the principles of great help!
KMean
- KMEAN C# In data mining, k-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results in a partitioning of the data sp
1975ClosestPoint
- 维诺图分治法的经典论文，里面提出了如何使用分治法生成维诺图，值得研究-Voronoi diagram of divide and conquer classic paper, which proposed how to use a divide-and-conquer method to generate the Voronoi diagram, worthy of study
geompack3
- 基于三角形网格的网格生成方法，用于网格生成的fortran90程序，非常好用。-GEOMPACK3 is a set of routines for certain computational geometry problems. In particular, it can compute the Voronoi diagram, and the Delaunay triangulation, of a set of points in the plane.
dijk
- Dijkstra算法可以解决voronoi图中求解最短路径-Dijkstra' s algorithm can solve voronoi diagram to solve the shortest path
clippedvoronoi
- voronoi图划分，用于点云的三角剖分，生成点云表面模型-voronoi graph partitioning triangulation for point cloud generated point cloud surface model
Km
- In data mining, k-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results in a partitioning of the data space into Vo
voronoi
- template sort program-sort program
Delaunay
- Delaunay三角形和Voronoi划分的迭代式构造-Delaunay triangulation and Voronoi division iterative construction
qhull-2012.1
- Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhul
diedaisi
- Delaunay三角形和Voronoi划分的迭代式构造-Delaunay triangulation and Voronoi division iterative construction
Cu_001z
- 产生维诺图的程序，这个程序是产生Cu的的文件-Generating a Voronoi diagram of the program, this program is generated Cu file
4
- 本程序实现delaunay三角形和voronoi划分的迭代式构造-The program voronoi delaunay triangles and divide iterative structure
qhull
- qhull生成算法，纯c语言实现。 通过顶点生成convex hull的快速算法，也会生成delaunay三角形和Voronoi图。- Qhull is a general dimension convex hull program that reads a set of points from stdin, and outputs the smallest convex set that contains the points to stdout. It also generate
voronoi3d
- python实现的三维空间维罗尼图算法演示。-3d voronoi use python
delaunay2
- This program demostrates how to use OpenCv library for iterative construction of delaunay triangulation and voronoi tesselation. It draws a random set of points in an image and then delaunay triangulates them.-This program demostrates iterative const
Dijkstra-algorithm
- Dijkstra算法用于解决解决voronoi图，matlab编制的-Dijkstra algorithm
dijk1
- Dijkstra算法,关于 Dijkstra算法解决voronoi图的问题,用 Dijkstra算法解决voronoi图中求解最短路径的时候,有一个"dijkstra.m"的文件-Dijkstra algorithm voronoi diagram on Dijkstra algorithm to solve the problem, using Dijkstra algorithm to solve voronoi diagram for solving the shortest path,