搜索资源列表
denary三角剖分
- denary三角剖分算法源码，用于离散点成面，自动构建面的高级算法，该算法非常难得，希望你们有所启发。-denary triangulation algorithm source code for the discrete points into face, the face automatically build senior algorithm, which is very rare that you have inspired.
用vc实现任意多边形的Delaunay三角剖分
- 计算几何作业（任意多边形的Delaunay完全三角剖分算法）演示程序,输入点的时候外圈按逆时针顺序，内圈按顺时针顺序，输完外圈最后一个点后请点击“外多边形节点输入结束”，每输完一个内圈最后一个点后请点击“内圈节点输入结束”再输入另一个内圈，全部输入结束后点击“多边形绘制完成”。最后点“Delaunay三角剖分”。包含实验报告以及相关论文
对任意给定的平面点集通过Delaunay三角剖分
- 对任意给定的平面点集通过Delaunay三角剖分进行处理可得到具有整体最优性的三角形网格-A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.
用Delaunay算法进行三角剖分
- 直接在VC试图上描点，对所获得的点集用Delaunay算法进行三角剖分。,Directly in the VC-point attempt on the depiction of the point set obtained by using Delaunay triangulation algorithm.
sanjiaopoufen
- 在VS2008和opencv下，对2D/3D点(云)数据实现三角剖分，运算速度快，实时性好，计算精度高，并对三角剖分进行了优化，可以处理复杂点集的三角剖分，可以用于人脸识别的工作-In the VS2008 and opencv, the pairs of 2D/3D points (cloud) data to achieve triangulation, calculation speed, real-time performance is good, high precision, and
package
- Delaunay 分治法进行三角剖分，同时对剖分后的三角面片进行动画模拟。-Divide and conquer Delaunay triangulation, while triangles after subdivision animated simulation.
Delaunay
- Delaunay 分治算法三角网格剖分！-Source code for DeWall, a divide and conquer 3d Delaunay
cgjava.tar
- Java图形编程软件包，提供多种三角剖分算法-Java graph programming software package, provides the many kinds of 涓夎
Fortune
- 一种优越的delaunay三角剖分,以及生成voinor图的程序，快速生成，算法简单。-A superior delaunay triangulation, as well as generate voinor plans, rapid generation, algorithm is simple.
DelaunayTriangulation
- 应用随机增量法实现的平面任何点集的三角剖分，有很大的参考价值-Application of random incremental method to achieve the plane of any point set triangulation, there are a lot of reference value
Delaunayjiyusuiyoutuke
- 基于最优凸壳技术的Delaunay三角剖分算法-Convex Hull based on optimal technology Delaunay triangulation algorithm
libmeshs
- 一个值得使用和下载的有限元网格剖分的源代码库-Use and download a finite element mesh of the source code library
93317441delanay_all
- delaunay三角剖分程序，能运行，可以显示-delaunay triangulation procedures, will be able to run, you can show that
delaunay_demo
- 2000个点的delaunay二维三角剖分-two demension trianglization of 2000 points
Delaunay_T945726142002
- vb lisp的三角剖分,可以稳健剖分点集-trianglization of vb-lisp
delaunay222
- vc7.0 编写的2000个点的二维三角剖分，剖分速度非常快！-very good！
voronoiView
- 针对平面内不相交的点或圆，根据三角剖分的原理，生成VORONOI图-For the plane does not intersect the point or circle, in accordance with the principles of triangulation to generate VORONOI map
geompack3
- Voronoi和delaunay三角剖分源程序软件，用于构建数值计算的有限元预处理工作-Delaunay triangulation and Voronoi source software for building a numerical calculation of the finite element pre-processing work
PolygonTriangulation_src
- c#实现的简单多边形的三角剖分工程文件 -PolygonEarCutting
cutpoly
- 凸多边形的最优三角剖分的vc++实现。输入：逆时针输入凸多边形P的顶点序列p1,p2…pn. 输出：P的三角剖分序列p1p2pi，p2pipj，…，plpn-1pn及三角剖分后的最优权值之和 -Optimal convex polygon triangulation of vc++ to achieve.