搜索资源列表
TINVORONOI
- vORONOI图由TIN生成算法，CSarp实现-vORONOI map by the TIN generation algorithm, CSarp achieve
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
Voronoi
- 先对散点进行三角网生成，然后再有三角网生成Voronoi多边形。还可以在生成的Voronoi图中继续追加散点，进一步生成新的Voronoi图。程序在Vc++2003环境下编译通过。-Get TIN through some points.Then derive Voronoi graph from TIN.After you get your first Voronoi graph,you can continue add new points to form new Voronoi graph
GEOMPACK
- 不规则三角网(TIN)能以不同层次的分辨率来描述地形表面,被视为DEM中最基本和最重要的一种模型。程序功能为带约束条件的离散点不规则三角网生成。-Voronoi diagrams, Delaunay triangulations
Voronoi
- Voronoi图生成。用到不规则三角网的建立，希望大分享-Voronoi diagram. TIN of the establishment used in the hope that a large share