搜索资源列表
geompack
- voronoi图及delaunay三角网格化程序-voronoi diagrams and delaunay triangulation gridding procedure
meshgeneration
- 计算用网格剖分程序，利用Bowyer-Watson method 法剖分，生成Delaunay网格-Calculation mesh generation procedure, and use law split Bowyer-Watson method to generate Delaunay meshes
2008DELAUNEY
- 二维delaunay三角形非结构化网格生成程序，较通用型网格生成，可以进一步优化，有益于对三维的程序编制。-Two-dimensional delaunay triangular unstructured grid generation procedure
trajet_drone_inc.m
- Delaunay trajectory center
LKHTSP
- 由Helsgaun改进的Lin-Kernighan局部启发搜索算法（LKH）求解大规模TSP问题，使用Java语言实现，具有强大的求解TSP性能。-Helsgaun improved the Lin-Kernighan local search algorithm (LKH) for solving large scale TSP problem, use the Java language, solving the TSP with a strong performance.
GEOMPACK
- 不规则三角网(TIN)能以不同层次的分辨率来描述地形表面,被视为DEM中最基本和最重要的一种模型。程序功能为带约束条件的离散点不规则三角网生成。-Voronoi diagrams, Delaunay triangulations
tesselacion
- Code to generate a Delaunay TIN based on 2D points
Delaunay2
- 三角网生成算法之一，可以有效、高速的构建合理的三角网-Generation algorithm of triangulation can be effective, high-speed triangulation to construct a reasonable
SurveyofTriangulation-Methods
- Delaunay三角剖分的几种算法综述，逐点插入、分治算法、生长算法-Survey of Triangulation Methods
contourTri_
- 这是一个基于三角网的等值线图与线性插值的三角形。-Contour plot based on Delaunay triangulation with linear interpolation across triangles
Seg
- A Fast Image Segmentation using Delaunay Triangulation
meshing1.1
- 这是用fortran写的一个delaunay三角网划分的程序-This is a program of the fortran write a delaunay triangulation network by
geompack3
- 基于三角形网格的网格生成方法，用于网格生成的fortran90程序，非常好用。-GEOMPACK3 is a set of routines for certain computational geometry problems. In particular, it can compute the Voronoi diagram, and the Delaunay triangulation, of a set of points in the plane.
dividePolygon
- 一种基于Delaunay算法的凸多边形的三角形网格的划分方法-Convex polygon algorithm based on Delaunay triangle mesh divided
DSNew
- 基于Delaunay算法的图像分割及像素聚类模型，可自适应估计聚类数，是一种有效的图像分割算法。-This function applies the Delaunay-based image segmentation, which is a fully automated process that does not require initial estimate of number of clusters.
triangulation-EN-cPP
- triangulation (un réseau de triangles est une triangulation de Delaunay si tous les cercles circonscrits des triangles du réseau sont vides)
numerical-recipe-code2
- 剑桥数据库源代码，包括correl、delaunay等算法-Cambridge database source code, including correl, delaunay algorithm
tricontour
- TRICONTOUR Triangular Contour Plot. TRICONTOUR(TRI,X,Y,Z,N) draws scalar N contour lines treating the values in Z as heights above a plane. TRI,X,Y,and Z define a triangulation where the triangles are defined by the M-by-3 face matrix TRI,
trapezoidalmap
- 平面点集的Delaunay三角剖分。为了验证Delaunay三角剖分的正确性，系统提供了“圆测试”的功能，供用户对生成的三角形进行测试验证；为了验证DCEL数据结构的正确性，系统提供了“DCEL测试”的功能，用户输入任意一条测试线，系统将先后显示出测试线贯穿过的三角形；为了形象显示三角剖分的分治过程，系统提供了动态显示分治剖分过程。 -Planar point set Delaunay triangulation. In order to verify the correctness of De
delaunayG
- delaunay triangulation graph