搜索资源列表
voronoi
- 一个绘制Voronoi图和Delauany三角剖分的程序，并且给出了求凸包的算法。该程序可以演示如何进行三角剖分，帮助你理解整个剖分过程。-a Voronoi diagram mapping and triangulation Delauany procedures, and is seeking a convex hull algorithms. The procedure can demonstrate how triangulation, and help you understand t
triangle
- Shewchuk的三角剖分算法，能剖分带孔的离散点，PII233 剖分一百万个离散点只需20秒。-Shewchuk 涓夎
cdtall.tar
- Constraint Delaunay triangulations,用于剖分具有外部轮廓线或内部轮廓线的离散点集 -Constraint Delaunay triangulations, uses in to cut in half has exterior contour line or the internal contour line separate set of points
c_delaunay
- 一个老外编写的三角剖分代码,运行效果好C-a foreigner prepared by the triangulation code, effective running C
light_project
- 基于光线投射变换的三维模型特征提取,以三维模型的重心为球心的最小包围球剖分成一系列同心球壳，落入每个球壳的射线与模型表面的交点定义一个球坐标方程。一般地，对于每条射线，它与模型表面的多个交点同时落入一个球壳的几率大大降低了，这样就可以尽可能的减少信息的丢失。-Transform-based ray-casting feature extraction of three-dimensional model to three-dimensional model for the core focus
InPolygon
- 在三角剖分种去掉内环，需要判断点、线段、三角形与多变形的关系。这个模块提供这样的功能。-Species in the triangulation to remove the inner ring, you need to determine the point, line, triangle and polygon of relationships. This module provides this functionality.
Delaunay
- 简单多边形的三角剖分,在计算机图形学及地学问题三维重建领域有着广泛的应用.根据简单多边形的定义和三角剖分原则,提出了一种简单多边形三角剖分的算法,该算法通过判断某顶点和基边之间的位置来实现对简单多边形的三角剖分算法实现简单容易理解适用于任意简单多边形的三角剖分-Triangulation of simple polygon in computer graphics and three-dimensional reconstruction to study the problem has wide
bc_Delaunay
- 多边形三角形剖分 图形处理 C实现 多边形三角形剖分 图形处理 C实现-Polygon triangulation polygon graphics to achieve triangulation C C implementation of graphics
triangulation.tar
- 对于不带洞多边形的三角剖分算法，速度比较快，但是不是最优剖分-fast triangulation method，but not perfect，maybe strange triangles！very long triangle！
StructTriMesh
- 朋友给的平面离散点的三角剖分程序，很好用，但我看不是太懂，希望下载的朋友能多多指教！有意讨论者加我qq1017926909-Friends of discrete points to the plane triangulation procedure is useful, but I do not understand too, want to download a lot of advice to a friend! Plus I intend to discuss qq1017926909
图剖分算法
- 一系列的图剖分算法，包括 - Complete-linkage algorithm - Single-linkage algorithm - Divisive min-diameter - Divisive sum-of-diameters - Agglomerative sum-of-diameters - K-Center algorithm
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.
工型有限差分程序
- 1、对求解区域进行网格剖分，网格越小，精度越高。 2、将边界条件离散到格点上。 3、用五点差分建立求解方程，求出各个各点上的函数值。(1, mesh the mesh of the solution, the smaller the grid, the higher the accuracy. 2, the boundary conditions are discretized to the grid. 3, five point difference i
faultresampler
- 利用自动剖分技术进行断层参数的反演，非常有用！(It is very useful to use automatic subdivision technique to inverse the fault parameters!)
delaunay_test
- 运用delauney三角剖分原理实现对三维图像的三角剖分(The triangulation of 3D image is realized by using delauney triangulation principle)
Delaunay三角网剖分算法，速度超快，值得一学
- Delaunay三角网剖分算法，速度超快(AppWizard has created this Delaunay_Li application for you. This application not only demonstrates the basics of using the Microsoft Foundation classes but is also a starting point for writing your application.)
iso2mesh-1.8-win32
- iso2mesh, 网格剖分应用程序。 网格剖分应用程序。(iso2mesh, Mesh generation application program. Mesh generation application program.)
强大的约束三角剖分程序源码
- 纯C语音编写的强大的约束三角网剖分程序，支持特征线(Pure C, a powerful constraint triangulation program to support feature lines.)
tetgen-1.5.0
- 是一款用于三维模型网格三角化剖分的工具。(TetGen is a program to generate tetrahedral meshes of any 3D polyhedral domains. TetGen generates exact constrained Delaunay tetrahedralizations, boundary conforming Delaunay meshes, and Voronoi partitions. The following pictures
MyCrust
- 对激光雷达点云进行三角剖分，对传统Crust算法进行了改进(Triangulation of LIDAR point cloud)