搜索资源列表
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
2D
- C code for \"Computational Geometry in C (Second Edition)\": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(
利用OpenGL实现三维地形
- 此资料介绍的是：利用OpenGL实现三维地形可 视化,采用Delaunay三角化法得到地形采样点,并用已知数据对三角曲面进行插值加密,生成规则格网(GRID)数据结构的方法,可得到高度真实感的三维地形可视化效果。 -The data presented are: the use of OpenGL for three-dimensional terrain visualization, using Delaunay triangulation method to be terrain
Delaunay
- Delaunay 分治算法三角网格剖分！-Source code for DeWall, a divide and conquer 3d Delaunay
Ccode2.tar
- c语言计算几何 三角化 Ch1, Code 1.14 凸形外壳[2D] Ch3, Code 3.8 凸形外壳[3D] Ch4, Code 4.8 球 Chapter 4, Fig. 4.15 德劳内类型 Ch5, Code 5.2 ...See *English version.-\Computational Geometry in C\ the book s recipe Triangulate Chapter 1, Code 1.14 /tri Convex
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,
Caylus_map_3D.m
- Generation of 3D MAP with Delaunay
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
qhull-2010.1
- 一个快速实现三维凸包的程序,并且有Delaunay三角化，半平面交，voronoi图。-a 3D quickhull program，and has delaunay triagulation,half intersection,voronoi programs.
winPointCloud
- 基于VTk的点云显示，构网（Delaunay Tin，包含二维，三维，及TEN）。附有详细的代码注释，也有实例数据。-The point cloud based VTk display, configuration network (Delaunay Tin, including 2D, 3D, and TEN). With detailed code comments, but also instance data.
PlantraEN1608
- Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines
TIN
- delaunay 三角剖分，三维点云，可以显示。-delaunay trianglation, 3D pointclound, run good.
Delaunay
- delaunay三角化实现三角网格剖分，并能够实现3D显示-delaunay triangulation triangular mesh, and 3D display
vtk2DDelaunayGeneration
- C++结合VTK三维可视化库，实现2D和3D Delaunay网格生成的代码，是学习vtk管线编程和 Delaunay 三角网格生成的很好的程序代码-2D & 3D Delaunay Mesh Generation implemented by c++ & vtk
triangulation-algorithm
- 三维折剖面的Delaunay三角剖分算法-Delaunay triangulation algorithm for 3D folded profile
Triangulation_3
- 可以做三维的三角剖分，速度快，效率非常非常高。-is used for 3D Delaunay triangulation
Delaunay3D
- VTK delaunay3D 实例 ,VTK库中的delaunay3D 来进行点云的三角化。-This example creates a tetrahedral mesh from unorganized points. The example uses the vtkDelaunay3D filter. The resulting mesh will be a solid convex hull of the original points. The example takes the po
delaunaywpf_src
- delaunay 3d wpf实现的剖分程序，算法支持三维散乱点的三角剖分-delaunay 3d wpf
CGAL-4.5
- CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和
基于VTk的点云显示
- 基于VTk的点云显示，构网（Delaunay Tin，包含二维，三维，及TEN）。附有详细的代码注释，也有实例数据。-(VTk based point cloud display (Delaunay, Tin, including 2D, 3D, and TEN). With detailed code notes, there are examples of data. -)