搜索资源列表
Mag_YXDYFyantuo.F90
- 磁场有限元位场延拓, 利用有限单元法三角剖分和线性差值,进行位场延拓-FEM magnetic field continuation, using the finite element method triangulation and linear interpolation, bit-field extrapolation
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
erwei
- 最大最小角实现二维三角剖分,用于建立数字高程模型-To achieve the maximum and minimum angle of two-dimensional triangulation
opencvdelaunaydemo
- 狄劳内三角剖分,opencv采用的三角网生成算法-opencv delaunay2
delaunay-triangulation
- 在matlab中用delaunay函数实现三角剖分,在一个三角形区域内,实现简单的均匀的delaunay剖分。-In matlab function implementation using delaunay triangulation, in the area of a triangle, a simple uniform delaunay triangulation.
triangle
- 伯克利大学给出的三角剖分的完整程序,使用标准c++语言编写,注释完整,可靠性强。 稍作修改,修改内容已经注释-A complete program triangulation Berkeley university is divided, using standard c++ language, notes integrity, strong reliability.
DELAUNAY
- delaunay三角网构建,三角剖分,用于提取骨架线-delaunay triangles construct
delaunaywpf_src
- delaunay 3d wpf实现的剖分程序,算法支持三维散乱点的三角剖分-delaunay 3d wpf
DelaunayPopengl
- 采用随机增量法实现的delaunay三角剖分,并使用opengl绘制出剖分结果(本人学习过程中写的代码,仅供学习交流)-delaunay triangulation and opengl drawing
AnyShape
- 利用三角剖分法,实现任意形状工作面的开采沉陷预计-Use triangulation method to achieve any shape face subsidence prediction
3jx
- 强大的约束三角剖分程序源码,一般且于地理计算,像GIS,图像等-This is about 3jx program.Home downloads source codes Google file type: GuestBook www.pudn.com VIP search source codes in more than 7,000,000 files. www.pudn.com 2004 ...
grid-sequence-method
- 计算机图形学,科学可视化,网格序列法,三角剖分法-Computer graphics, scientific visualization, grid sequence method, triangulation method
DelaunayTriangulation
- delaunary三角剖分,在数据点较小的情况下,运行结果还算客观,但是数据点大于五万时,运行较慢。-Delaunary triangulation, data point in the case of small, the operation results is objective, but the data points is greater than fifty thousand, is running slower.
Delaunay
- delaunary三角剖分,在数据点较小的情况下,运行结果还算客观,但是数据点大于五万时,运行较慢。-Delaunary triangulation, data point in the case of small, the operation results is objective, but the data points is greater than fifty thousand, is running slower.
CGAL-4.5
- CGAL,Computational Geometry Algorithms Library,计算几何算法库,设计目标是,以C++库的形式,提供方便,高效,可靠的几何算法。CGAL可用于各种需要几何计算的领域,如计算机图形学,科学可视化,计算机辅助设计和建模,地理信息系统,分子生物学,医学成像,机器人运动规划,网格生成,数值方法等等。 计算几何算法库(CGAL),提供计算几何相关的数据结构和算法,诸如三角剖分(2D约束三角剖分及二维和三维Delaunay三角剖分),Voronoi图(二维和
2
- 对图像进行三角剖分,对三角点云数据进行处理。以便更好的显示图像、。-The image triangulation, triangular point cloud data processing. In order to better display image.
delaunay_poufen
- delaunay三角剖分的算法,主要是根据边扩展来构建三角网的算法,有简单的界面设计实现 -delaunay triangulation
Delaunay
- Delanuny三角剖分源码,效果还可以-Delanuny source
Delaunay-triangular-mesh-generation
- 在平面随机生成散列的二维点,点数可由用户输入,然后将散列的点进行delaunay三角剖分,生成三角网。代码较老,可以继续改进。-delaunay triangulation
Featurepoint2Delaunay
- 本代码使用Opencv开源库实现,首先使用sift算子进行特征点提取,然后使用opencv中的三角剖分函数以所提取的特征点为基本点进行三角剖分。-This code uses Opencv open source library implementation, first using sift operator the feature point extraction and use of triangulation opencv functions to the extracted featu