搜索资源列表
Voronoi_visualization
- 很好的三角划分网格Voronio 很好的三角划分网格Voronio-Good triangulation Voronio good mesh grid triangulation Voronio
dct
- O(nlgn) Delaunay Triangulation
toolbox_graph
- 包含图论中很多有用的方程,可以设置成为matlab的一个工具箱 便捷实用-This toolbox contains useful functions to deal with graph and triangulation.
Delauney
- Delauney三角剖分,对三维的地形可进行较好的描述。-Delauney triangulation of the three-dimensional terrain can be a better descr iption.
Morec
- Morec算子,三角网显示 Morec算子 三角网显示-Morec operator, triangulation Morec operator display shows Morec triangulation triangulation operator display
cdt
- 三角剖分,是图论和计算几何中非常有名的算法。该代码需要shar的解压缩工具。-Triangulation
triangulation.tar
- 为面绘制中的多边形的三角化程序,对于面得增加或者减少进行了比较详尽的讲解-For the surface rendering of polygons in a triangular-based program, for the surface may increase or decrease were compared with detailed explanations
0141111111
- 三角划分算法演示版,功能超强,是由外国人写的代码,很有学习价值!-Triangulation algorithm demo, features powerful, is the code written by foreigners, great learning value!
Triangle-HDM
- 南方CASS软件中只能采用数据批量生成断面里程文件,而工作中往往需要对三角网进行修改以便更加符合实际地形。而CASS中没有根据三角网批量生成断面里程的功能,只能一条一条的切出来,工作量十分巨大。以小野的工作来看,在包含几十万个三角网的CAD图形中根据三角网单独切断面,每条断面里程文件的生成需要约十秒左右的时间,不仅工作量巨大,而且十分考验人的耐心和细致。终于,有一天小野忍受不了那个速度,就写下了这个小程序。因为仅是为了实际工作需要,所以没有花时间去做界面。经测试,125361个三角形构成的三角网
delauney
- 用Fortran开发三维球面delauney三角网剖分程序可用于曲面造型、最小生成树应用领域-Fortran development with three-dimensional spherical delauney Triangulation program can be used for surface modeling, minimum spanning tree applications
TIN_Construction
- 自动为TIN模型构建Delaunay三角网的VC源程序,可以应用于测绘,地质,交通等行业的数字地形模型的实现.-Automatic for the TIN model construction of the VC source Delaunay triangulation can be applied to mapping, geology, transportation and other industries digital terrain model implementation.
delauney_Tin
- TIN三角型网格产生算法源码,具体使用“三角形由内而外生成”算法实现的TIN网格形成,运算量小,Tin三角网产生迅捷准确。-TIN triangle mesh generated algorithm source code, specifically using the " triangle is generated from the inside out" algorithm to achieve the formation of TIN grid, computing a
testDelaunay
- 在VC++6.0环境下生成Delaunay三角网-In VC++6.0 environment generates Delaunay Triangulation
DelaunayVB
- 用VB实现Delaunay三角网的生成算法-Achieved with the VB Algorithm Delaunay Triangulation
delaunayprogramming
- 三角剖分算法,delaunay的三角剖分 三角剖分算法,delaunay的三角剖分-triangulation programming
sjpf
- 三角剖分求二维平面上的点集的一个最小生成树,算法复杂度为O(nlogn)。-Seeking two-dimensional triangulation of points on the set of a minimum spanning tree, the algorithm complexity is O (nlogn).
TrianPPS
- 计算平面点集的Delaunay三角剖分。使用DCEL数据结构。右键点击可以实现平面的直线穿刺。-Calculate the Delaunay triangulation of planar point set
triangled1
- 插入法实现三角化和Voronoi图,并且可以实现他们的动态显示-Insertion method to achieve triangulation and Voronoi diagram, and can achieve their dynamic display
triangulation_order6_boundary_node
- 有限元方法分析典型结构,采用六节点三角形单元-This programming give an order 6 triangulation, an abstract list of sets of six nodes. The vertices are listed clockwise, then the midside nodes.