搜索资源列表
triangulation
- 动态规划实现对多边形的三角剖分，顺时针定义各个顶点值实现最优剖分。-Dynamic program to achieve triangulation of the polygon.Clockwise to definit the value of each vertex achieve the optimal split.
Voronoi
- 先对散点进行三角网生成，然后再有三角网生成Voronoi多边形。还可以在生成的Voronoi图中继续追加散点，进一步生成新的Voronoi图。程序在Vc++2003环境下编译通过。-Get TIN through some points.Then derive Voronoi graph from TIN.After you get your first Voronoi graph,you can continue add new points to form new Voronoi graph
TIN_Voronoi
- Delualy 三角网 同时生成Vionoi多边形-Delualy also generate Vionoi polygon triangulation
Triangulardecomposition
- 任意多边形的三角凸分解的C语言程序源代码-Triangle Convex Polygon Decomposition of C language source code
triangulation.tar
- 对于不带洞多边形的三角剖分算法，速度比较快，但是不是最优剖分-fast triangulation method，but not perfect，maybe strange triangles！very long triangle！
convex-polygon-triangulation
- 给定一系列坐标定点，先判定能否构成凸多边形，然后进行最优三角剖分-Given a series of fixed-point coordinates, first determine whether the composition of convex polygons, then the optimal triangulation
vtkImplicitPolyDataBeta2-0001
- vtk多边形布尔运算源码,处理效果很棒,但对100000个以上的三角面片处理比较慢-vtk polygonal Boolean operations source code, the operation result is great, but for more than 100,000 triangles it is a little slower
333
- 求凸多边形最优三角剖分。用动态规划问题有效解决该问题。多边形是平面上一条分段线形封闭曲线。-Optimal convex polygon triangulation. Dynamic programming problem with an effective solution to the problem. Sub-polygon is a plane closed curve linear.
programme
- 将不带洞的任意多边形进行三角分割源得到分割后三角形的顶点代码-Will not be any polygon with a hole triangular split the source to be split after the vertices of the triangle code
12
- 很好的三角剖分程序，尤其是针对多边形的三角剖分。-Good triangulation procedures, especially for polygon triangulation.
CPolygon
- 定义了平面多边形类。 其中包括了多边形的很多方法：中心三角化，迪落尼三角化，判断对角线是否在多边形内，等。-Define a plane polygon class Including many polygon method: whether the center triangulation, Di off the Niger Delta, judgment diagonal within the polygon, etc..
MemDraw_V1.0.0.10
- 内存画图DLL，可以快速画出圆，矩形，三角，多边形等常见的图形以及各种曲线-Memory drawing DLL, can quickly draw circle, rectangle, triangle, polygon, such as graphics and a variety of common curve
Delaunay_WinForm
- 根据点生成狄洛尼三角网，以进一步生成泰森多边形-To generate Thiessen polygons based on points generated Di Luoni Triangle
wuyang
- 动态规划----多边形的最优三角剖分 输入测试用例个数 和 各个点的坐标 输出弦长最短的边的总和-Optimal Dynamic Programming---- polygon triangulation input test case number and the coordinates of each point of the output side of the chord length of the sum of the shortest
Algorithm-analysis-
- 算法分析与设计论文附加代码,动态规划解决凸多边形的最优三角分割和回溯法解决哈密顿回路问题-Algorithm analysis and design thesis additional code, dynamic programming to solve the optimal convex polygon triangulation and backtracking to solve the problem Hamiltonian circuit
CGAL-4.5
- CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和
triangle
- 2D凸多边形的三角网格生成，可用gridgen。-2D triangular convex polygon mesh generation, available gridgen.
voronoi-diagram
- 一个关于泰森多边形以及德劳内三角划分的JS实现，仅仅包括算法的JS代码，注意-About Thiessen polygons and a Delaunay triangulation of JS implementation includes only algorithm JS code, note
TINandVoronoi
- 通过逐点增入法生成delaunay三角网，在链接外接圆圆心生成泰森多边形-It uses c# to construct delaunay triangle and voronoi
sanjiao
- 最小权重三角划分。输入一个多边形顶点坐标，输出具有最小权重的三角划分。-The minimum-weight triangulation problem is the problem of finding a triangulation of minimal total edge length. That is, an input polygon or the convex hull of an input point set must be subdivided into triangles