搜索资源列表
CQuadDissect
- Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割—归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割—归并法相当，较好的情况下快于分割—归并法。-Delaunay Triangulation as a major DTM Fall ta
Delaunay-Trianglation-Mesh-Generation
- 这也是一个delaunay三角网的程序，功能是我见到最强大的。能生成二维和三维，并有openGl创建模拟三维图。原程序中编译时需要wx/的文件，我没有找到。不过不影响程序的学习.希望对你有用！！包中有.exe可先-This is a triangular network nodes procedures, I see the function is the most powerful. Can generate two-dimensional and three-dimensional, and
delanay_all
- 这时一个delaunay三角网的程序，功能强大，并里面有详细说明和程序及原代码。能创建二维和三维的，且能生成模拟的3D图。-then a triangular network nodes procedures, powerful, and there are detailed procedures and the original code. To be able to create two-dimensional and three-dimensional and can generate s
tetgen1.4.1
- A Quality Tetrahedral Mesh Generator and Three-Dimensional Delaunay Triangulator.-A Quality Tetrahedral Mesh Generator and T hree-Dimensional Delaunay Triangulator.
TriNet
- 不规则三角网的生成源代码。This program generates Triangulated Irregular Network, or TIN from scattered points on two-dimensional plane based on Delaunay s triangulation. This data structure allows data to be displayed as three-dimensional surface, or to be used f
ttl-1.0.0
- 德劳内三角算法实现二维或三维任意点的三角网格划分C-Delaunay triangulation algorithm arbitrary two-dimensional or three-dimensional triangular point mesh C
1234567899988基于matlab软件的delaunay算法划分网格
- 基于matlab软件的delaunay算法划分网格，可以进行三维数据和二维数据的处理,Matlab-based software division algorithm delaunay mesh, can be three-dimensional data and two-dimensional data processing
利用OpenGL实现三维地形
- 此资料介绍的是：利用OpenGL实现三维地形可 视化,采用Delaunay三角化法得到地形采样点,并用已知数据对三角曲面进行插值加密,生成规则格网(GRID)数据结构的方法,可得到高度真实感的三维地形可视化效果。 -The data presented are: the use of OpenGL for three-dimensional terrain visualization, using Delaunay triangulation method to be terrain
Delaunay00000
- 论文 Delaunay三角网表示和点删除方法 用vc的环境 很重要-Papers Delaunay triangulation and the point that the method used to delete a very important environment vc
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
triTIN
- 程序生成TIN三角形，根据2D或者3D的离散点生成，分析-This program generates Triangulated Irregular Network, or TIN from scattered points on two-dimensional plane based on Delaunay s triangulation. This data structure allows data to be displayed as three-dimensional surface,
Delaunay
- Delaunay三角剖分算法 . 一个非常强劲的VC编的Delaunay三角网生成算法，对您学习VC++或GIS的学习都有很好的帮助作用-In mathematics, and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle o
ppt-triangel
- 本專題分為3大部份 1. 對單一圖片做邊緣檢測後, 統計其複雜度, 再以 Delaunay 三角網來分割複雜度較高的圖形, 將此圖形之三角網的三點座標與RGP值 取樣後壓縮儲存, 及達成壓縮目的. 還原部份為, 以線性內插則是將取樣後的三角網三點內插後還原之原理, 還原單一影像, 再將所有還原之影像串連撥放即完成之影片還原. 2.讀取RS-232接至RFID門禁系統, 讀取Myfair悠遊卡之卡號, 進行身份辨識後, 可選擇需要觀賞之影片.
Delaunay
- 简单多边形的三角剖分,在计算机图形学及地学问题三维重建领域有着广泛的应用.根据简单多边形的定义和三角剖分原则,提出了一种简单多边形三角剖分的算法,该算法通过判断某顶点和基边之间的位置来实现对简单多边形的三角剖分算法实现简单容易理解适用于任意简单多边形的三角剖分-Triangulation of simple polygon in computer graphics and three-dimensional reconstruction to study the problem has wide
3DDelaunay
- 散乱点数据的三角剖分及在三维显示，利用一种平面散乱点集的Delaunay三角剖分算法来对散乱点数据进行剖分-Triangulation of scattered data points and in three-dimensional display, using a planar set of points scattered Delaunay triangulation algorithm for triangulation of scattered data points
Delaunay
- 一种支持三维Delaunay三角剖分与Voronoi图生成的数据结构，有详细介绍。-That supports three-dimensional Delaunay triangulation and Voronoi diagram data structure, described in detail.
qhull-1.0
- 该程序能够对基于二维平面的散乱点进行三角剖分，能够使数据以三维显示。可以应用于地形分析-This program generates Triangulated Irregular Network, or TIN from scattered points on two-dimensional plane based on Delaunay s triangulation. This data structure allows data to be displayed as three-dimen
等值线图的彩色填充方法
- 等值线图的彩色填充方法、三次B样条插值算法、基于Delaunay三角网的区域等值线绘制关键算法、基于边界点追踪的等值线图区域填充算法相关论文和程序，难得研究算法和程序。-Contour color filling method, three B spline interpolation algorithm, based on the Delaunay triangulation area contour drawing key algorithm, based on boundary track
Delaunay
- 构建Delaunay立体三角网，适用于有限元分块，地理信息系统处理的算法，-Construction of three-dimensional Delaunay triangulation for finite element block, geographic information systems processing algorithms,
delaunay-algorithm
- 高质量的笛氏三角网格化，为重建三维图形提供有力的帮助. 附件有原码和调用方法,Delaunay三角网格化已封装成一个类，用户只需要传入点坐标标就可以得到最优的三角形。-High-quality flute s triangle grid, three-dimensional graphics for the reconstruction to provide effective help. Attachment with the original code and call the method