搜索资源列表
VC++Delaunay
- 采用序列化对象CArchive读入原始数据构建Delaunay三角网的VC++代码。可以鼠标点击加新点进行构网，包括二维、三维。还可以进行设色、光照等。
Delaunay
- 构建Delaunay三角网的VB源TriangleDevelopment
Delaunay
- Delaunay三角网构建，实现语言：Visual Basic
1234567899988基于matlab软件的delaunay算法划分网格
- 基于matlab软件的delaunay算法划分网格，可以进行三维数据和二维数据的处理,Matlab-based software division algorithm delaunay mesh, can be three-dimensional data and two-dimensional data processing
Delaunay
- 基于德洛内三角分解的有限元划分，可形成刚度总阵-Delaunay triangulation based on decomposition of the finite element division, the total stiffness matrix can be formed
DELAUNAY.algorithm
- DELAUNAY三角剖分算法源程序c++实现。非常详细的源代码。-DELAUNAY triangulation algorithm source code c++ implementation. Very detailed source code.
code
- 二维非结构网格生成程序。用 Delaunay 三角形化方法，实现x‐y 平面上给定的梯形区域的非结构化网格划分。-Unstructured mesh generation process. Delaunay triangulation method used to achieve x-y plane of the trapezoidal region given unstructured mesh.
DelaunayTriangulation
- Delaunay trianglation 是平面三角化的一种重要方法，也可以应用于三维的四面体的生成。因为用这种方法产生的四面休在有限元分析中具有其独特的优势而受到重视。-Delaunay trianglation plane triangulation is an important method, but also can be applied to the generation of three-dimensional tetrahedron. As generated in this
1111111111111111111
- 详细介绍了 用基于Matlab软件实现Delaunay剖分和基于剖分的规格化计算-Described in detail based on Matlab software implementation Delaunay mesh and mesh-based calculation of standardized
Delaunay
- 分别用VB和delphi开发的Delaunay三角形类算法源码-Were developed in VB and delphi algorithm source Delaunay triangle
TrianPPS
- 计算平面点集的Delaunay三角剖分。使用DCEL数据结构。右键点击可以实现平面的直线穿刺。-Calculate the Delaunay triangulation of planar point set
delauney
- Delaunay triangulation VC
tin
- Delaunay三角网作为一种主要的数字地形模型表示法，经过二十多年来的研究，它的生成算法已趋于成熟。本算法是一个基于Delaunay的很强壮的构三角网(TIN)的算法。-Delaunay triangulation as a major representation of digital terrain model, after 20 years of research, it generates algorithms have been mature. This algorithm is b
Delaunay
- 二维Delaunay插点算法,等值线应用-Two-dimensional Delaunay insertion point algorithm, contour Applications
delaunay
- 方便的构造不规则三角网的面向对象程序，值得跟大家分享交流-A convenient structure TIN object-oriented programming, it is worth sharing with you the exchange
qhull-2010.1-src.tar
- QHull Delaunay Triangulation
QuickDelFEX123
- MEX routines that can be a faster alternative to the Matlab built-in Delaunay triangulator
nearestneighbour
- Compute nearest neighbours (by Euclidean distance) to a set of points of interest from a set of candidate points. The points of interest can be specified as either a matrix of points (as columns) or indices into the matrix of candidate points.
BallFretting190809
- This tool is a simplification of the ballpivoting algorithm. It imagines a bella eating a delaunay traignulation in order to extract a manifold surface. It requires a single parameter: radius of the fretting ball. Ball Fretting Given a unif