1) 3D-Delaunay
三维Delaunay
1.
An algorithm of interpolating mesh boundary incremental construction is presented in this paper based on local 3D-Delaunay, since it is difficult to realize mesh linear and 3D-Delaunay construction, which automatically generates mesh model from measured objects through its boundary locally 3D-Delaunay constructing, inflating, separating, self-trimming.
网格构造的质量和效率是插值于大规模测量点三角网格构造算法的关键,但在算法中既保证插值网格的三维Delaunay性质又实现网格的线性构造仍存在困难。
2) 3D Delaunay triangulation
三维Delaunay剖分
3) 2D constrained Delaunay triangulation
二维约束Delaunay三角化
4) Delaunay Triangulation
Delaunay三角化
1.
Delaunay triangulation and Voronoi diagrams for Riemannian manifolds
黎曼流形的Delaunay三角化和Voronoi图
2.
During the process,feature-map of the image was extracted at first,followed by the mesh generation for the purpose of image representation using Floyd-Steinberg algorithm and 2-D Delaunay triangulation algorithm.
在图像恢复过程中,首先提取图像的特征图,并利用Floyd-S teinberg算法和Delaunay三角化算法产生网格,用来表达图像;然后利用正则化方法对网格节点的灰度值进行迭代,从而恢复该节点的灰度值;最后利用已恢复的网格节点对像素点进行Lagrange插值,从而得到恢复后的图像。
3.
Based on Delaunay triangulation and its local updating property,this algorithm can update the changed region directly under the circumstances that only part of the source images has been changed.
提出了一种具备动态数据更新能力的影像超分辨率重建算法,该算法以Delaunay三角化为基础,利用Delaunay三角网的局部可更新性质,能在目标影像的数据源发生变化的情况下仅针对变化数据对重建结果直接进行更新,较好地解决了常规影像超分辨率重建算法复杂度高、适用模型单一、稳健性差和病态求逆等问题。
5) Delaunay triangulation
Delaunay三角网
1.
A new growth algorithm for creating delaunay triangulation:outside insertion algorithm;
构建Delaunay三角网的一种新型生长法——壳外插入法
2.
The research of skeletonization algorithm based on Delaunay triangulation;
基于Delaunay三角网的骨架提取算法研究
3.
Study on an algorithm for fast constructing Delaunay triangulation;
快速构建Delaunay三角网算法研究
补充资料：AutoCAD二维文件转化成solidworks三维文件
图1
图2
图3
图4
图5
图6
图7
|
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条