搜索资源列表
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
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,
lecture2-650
- Present a mathematical framework for discussing the topics in the remainder of the courseDuality, Convex Hulls, Envelopes, Voronoi Diagrams, and Delauney Triangulations-Present a mathematical framework for discussing the topics in the remainder of th
voronoiPumat
- voronoi图生成算法，voronoi生成算法资料，umat开发程序资料-voronoi figure,umat
src
- How to use the ordinary Voronoi partition generator. The m-files also have their own help documentation that you can view in Matlab. This code creates a bounding polygon that is a square. Then it randomly creates 10 points and then creates and
fun_traindic_kmeans
- kmeans 聚类算法，主要用来对一堆数据形成他们的码本-k-means clustering is a method of vector quantization originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which ea
delaunay.c
- delaunay三角形和voronoi划分的迭代式构造-voronoi division of delaunay triangles and structure of the iterative
Delaunay_triangle
- 利用Delaunay三角形和Voronoi划分的迭代式进行平面的划分，本程序基于OpenCV实现-failed to translate
awvoronoi-run-1.0.0
- matlab加权 voronoi 剖分网格代码。方便简单。 适合入门与科研应用。-matlab mesh generation code. Convenient and simple.voronoi