搜索资源列表
e2md2.m
- BEMD对图像进行分解，包络构造采用Delaunay三角剖分和三次插值，得到分解的结果。 输入：灰度bmp图像 输出：imf1 imf2 imf3 残差-BEMD image decomposition, the envelope structure using Delaunay triangulation and cubic interpolation, the result of decomposition. Input:
delaunay
- 利用Delaunay三角剖分算法来进行的三维建模技术在建筑，地质地形勘测，医学图像建模，动画设计等各方面都有广泛的应用。本软件实现逐点插入算法，并且在综合参考以往逐点插入算法的基础上，提出自己的想法，在某些具体细节上进行改进。-Using Delaunay triangulation algorithm for three-dimensional modeling techniques in the construction, geol
meshcircle2
- 基于有限单元法的三角剖分圆的MATLAB程序-Finite element method based on triangulation of the circle MATLAB program
denary
- vc++ 作的三角剖分，很好用的，希望对同行有所帮助-vc++ for triangulation, well used, and they hope to help peer
triSplit
- 凸多边形最优三角剖分，代码开放，彼此交流-Optimal convex polygon triangulation, code open exchange
delaunaytriangulation
- 介绍了点与有向线段关系判断方法和凸包生成算法；提出了一种基于凸包的Delaunay三角剖分方法，采用VC#实现了该算法。实践表明该方法程序实现较简单，计算效率较高。 -Introduction of the point and line segment has to determine the relationship between the methods and convex hull generation algorithm
Ccode2.tar
- 计算几何讲义源代码 包括三角剖分, 凸包(二维,三维), 几何查找, 运动规划-Computational geometry, including source code handouts triangulation, convex hull (two-dimensional, three-dimensional), geometric find, motion planning
guihuazuiyou
- 算法分析与设计基于动态规划的凸多边形的最优三角剖分设计报告-Algorithm Analysis and Design Based on Dynamic Programming Optimal convex polygon triangulation design report
PolySplit
- 凸多边形三角剖分问题.给定一个凸多边形,每个边上给定一个权值,要求把凸多边形分割成一个个的三角形,使得诸三角形的权值之和最小.-Convex polygon triangulation problems. Given a convex polygon, each edge of the right to set a value, called convex polygon divided into a triangle, making
MC
- 有关MC算法的三篇pdf文章 1.移动立方体算法的三重线性插值研究 2.空间相关MC算法的VTK实现 3.移动立方体算法中的三角剖分-The MC algorithm of three pdf article 1. Marching Cube triple linear interpolation of 2. VTK space-related MC algorithm to achieve 3. Marching cube
Fortune
- 一种优越的delaunay三角剖分,以及生成voinor图的程序，快速生成，算法简单。-A superior delaunay triangulation, as well as generate voinor plans, rapid generation, algorithm is simple.
cvery_54517008
- 用vb编写的Delaunay三角剖分算法源码-Vb prepared using Delaunay triangulation algorithm source code
DelaunayTriangulation
- 应用随机增量法实现的平面任何点集的三角剖分，有很大的参考价值-Application of random incremental method to achieve the plane of any point set triangulation, there are a lot of reference value
2dDelaunay2
- 直接在VC试图上描点，对所获得的点集用Delaunay算法进行三角剖分。-Directly in the VC-point attempt on the depiction of the point set obtained by using Delaunay triangulation algorithm.
Delaunayjiyusuiyoutuke
- 基于最优凸壳技术的Delaunay三角剖分算法-Convex Hull based on optimal technology Delaunay triangulation algorithm
93317441delanay_all
- delaunay三角剖分程序，能运行，可以显示-delaunay triangulation procedures, will be able to run, you can show that
triangulation
- 三角网剖分 将平面数据点进行三角剖分 快速构建delaunay三角网-delaunay triangulation which can triangulate the dots on the plane
delaunay_demo
- 2000个点的delaunay二维三角剖分-two demension trianglization of 2000 points
Delaunay_T945726142002
- vb lisp的三角剖分,可以稳健剖分点集-trianglization of vb-lisp
delaunay222
- vc7.0 编写的2000个点的二维三角剖分，剖分速度非常快！-very good！