搜索资源列表
VoronoiGraph
- Voronoi图在最近几年中应用比较广泛，我上传的是用java写的Voronoi图生成源码-Voronoi diagram in recent years in widespread use, I used to upload java is the Voronoi diagram was generated source
Voronoituxiang
- 基于VB开发的基于Voronoi图的空间分析-based on the VB Voronoi diagram based on the spatial analysis
voronoi图形的构建
- 关于voronoi图形的c语言构建！！
Voronoi_graph.zip
- Voronoi图的pascal实现算法，图论中一种很有用的算法,Pascal achieve Voronoi diagram algorithms, a very useful algorithm in graph theory.
VoronoiDAC
- 维诺图的GUI实现，使用VC++环境，非常棒的代码-The Voronoi diagram the GUI implementation, use VC++ environment, great code
triangled1
- 插入法实现三角化和Voronoi图，并且可以实现他们的动态显示-Insertion method to achieve triangulation and Voronoi diagram, and can achieve their dynamic display
TIN_Voronoi
- 构建离散点集的Voronoi图，算法大致流程:先构建Delaunay TIN,然后连接相邻三角形的重心记得Voronoi图，然后基于TIN的拓扑，构建Voronoi多边形的拓扑关系。-Construction of discrete point set Voronoi diagram algorithm for general processes: first, to build Delaunay TIN, then remember that the focus of a triangle c
visibility_graph_robot_motion
- visibility graph code developed on matlab, which uses astar search algorithm and minkowski difference - developed and updated from the previosly uploaded java source code
Delaunay-triangulations
- GEOMPACK - Voronoi diagrams, Delaunay triangulations GEOMPACK 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.
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!
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
voronoi
- Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法： 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题，即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解； 4) 该问题所分解出的各个子问题是相互独立的，即子问题之间不包含公共的子问题。 -Voronoi Diagram algorithm is mainly using the method of pa
voronoi-diagram
- 一个关于泰森多边形以及德劳内三角划分的JS实现，仅仅包括算法的JS代码，注意-About Thiessen polygons and a Delaunay triangulation of JS implementation includes only algorithm JS code, note
ex
- 定义边界Voronoi个数，用栅格法生成Voronoi图-The number of defined boundaries Voronoi, Voronoi diagram generated by grid method
Voronoi_di1814141142004
- Title: Voronoi diagrams Descr iption: Exploration of several pixel-based voronoi diagram algorithms. Voronoi diagrams are used to divide space (in this case 2D space) amongst a collection of points.
Cu_001z
- 产生维诺图的程序，这个程序是产生Cu的的文件-Generating a Voronoi diagram of the program, this program is generated Cu file
Cu_001z
- 产生维诺图的程序，这个程序是产生Cu的的文件-Generating a Voronoi diagram of the program, this program is generated Cu file
vonoroi
- 膨胀法Voronoi图的c算法，并且使用并行计算进行改进-Voronoi diagram expansion method
c++-voronoi
- 利用c++程序来实现voronoi图的生成，十分简单、有效(Using c++ program to achieve the generation of Voronoi diagram, very simple and effective)
Voronoi
- 用三角网方式生成Voronoi图，功能很详细(Create a Voronoi diagram with a triangulation method with detailed functions)