搜索资源列表
DelaunaySourceCodeJava14
- Voronoi图生成算法 ,Voronoi(沃洛诺依)多边形网络常常被用来做为计算机仿真模型.由于按照定义形成Voronoi多边形网络较难用程序实现,人们多采用Delauney(狄洛尼)三角形的方法完成模型的构建.大家可以交流
zz
- Voronoi图研究及其在RP螺旋扫描路径生成中的应用.rar
matlab
- 可以在matlab开发环境下自动生成voronoi图。
WindowsApplication5
- 采用C#建立Delaunay三角网同时可以生成Voronoi图。
voronoi2
- 基于Voronoi图的二维平面分割算法的FORTRAN语言实现
voronoi3
- 基于Voronoi图的三维空间分割算法的FORTRAN语言实现
fortune.rar
- fortune扫描线算法生成voronoi图的演示代码，可以动态观察算法运行，对原理的理解有很大的帮助！ ,This routing briefly describes what a Voronoi diagram is and provides an interactive demonstration of how these can be created using Fortune s plain-sweep algorithm.
voronoiView
- 针对平面内不相交的点或圆，根据三角剖分的原理，生成VORONOI图-For the plane does not intersect the point or circle, in accordance with the principles of triangulation to generate VORONOI map
uuu
- Java生成Voronoi图 (1)产生二维空间随机种子(数量预设) (2)对种子膨胀,直至空间结点全部被标记 (2.1)标记归属与距离值 (2.2)并记录上下次膨胀结点 (3)扫描二维空间结点,找出距结点 (4)在控件上给出种子与Voronoi图 -Voronoi diagram generation Java (1) generate a random seed of two-dimensional space (the number of default) (2
VoronoiDiagram
- 计算几何课程中voronoidigram的实现程序， 可随机输入种子点，然后生成voronoi 图-Computational geometry course in the realization of the procedure voronoidigram can enter a random seed point, and then generate voronoi diagram
MyVoronoi
- 学GIS的可以看看，手工添加点自动建立delaunay三角网和voronoi图-Learning that can take a look at GIS, manual add points automatically create delaunay triangulation and voronoi diagram
proposal
- 计算几何voronoi 图的算法说明和详细介绍，很好的Proposal-proposal of computational geometry
Delaunay
- 一种支持三维Delaunay三角剖分与Voronoi图生成的数据结构，有详细介绍。-That supports three-dimensional Delaunay triangulation and Voronoi diagram data structure, described in detail.
20100428
- 利用Voronoi图及其对偶Delaunay三角网研究平面离散点集拓扑邻近稳定区域的计算方法，给出拓扑邻近稳定区域的概念，证明点的拓扑邻近稳定区域必须满足的两个条件，给出点的拓扑邻近稳定区域定量计算模型，并通过试验证明其正确性。-A method to maintain the neighboring relations between each two points in discrete points set is studied based on the delaunay triangul
Voronoi
- 泰森多边形生成算法，先生成Delaunay三角形，再生成其对偶图泰森多边形；图形界面 MFC.-Tyson polygon generation algorithm, sir into Delaunay triangle, into its dual figure regeneration tyson polygon Graphical interface MFC.
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!
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
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
Dijkstra-algorithm
- Dijkstra算法用于解决解决voronoi图，matlab编制的-Dijkstra algorithm