1) Laguerre-Delaunay diagram
Laguerre-Delaunay图
2) Laguerre diagram
Laguerre图
3) Delaunay graph
Delaunay图
1.
The dynamic mesh deformation method based on Delaunay graph mapping is non-iterative and is therefore efficient for unsteady flow solutions.
基于Delaunay图映射的动态网格生成方法无需迭代计算,效率高,稳定性好。
2.
Secondly,the nearest connected graph in space with obstacles,also known as the Delaunay graph,is gained by trace back algorithm on the basis of Voronoi graph.
首先采用零初始化的思想,初始化"位"数据;然后在构建障碍空间下实体点的Voronoi图的基础上,通过障碍空间下的回溯算法得到实体点间的最近连通图,也即障碍空间下实体点之间的Delaunay图;最后根据连通图,采用贪婪策略来得到最小生成树。
4) Laguerre-Voronoi diagram
Laguerre-Voronoi图
5) Delaunay graph mapping
Delaunay图映射
1.
Recently, a new dynamic grid method based on Delaunay graph mapping was also proposed, which makes the moving or deforming of viscous grid easier and faster if the boundaries are moving.
另一方面,近年来发展出来的基于Delaunay图映射的动弹网格方法也取得了较大的成功,可以被用来较为有效地处理运动边界条件下粘性网格的变形运动。
2.
A novel dynamic cloud method based on Delaunay graph mapping strategy is proposed and the dynamic cloud method is used by algebraic mapping principles,thus the points can be accurately redistributed in the flow field without any iteration.
提出基于Delaunay图映射的点云运动处理技术。
6) Delaunay triangulation network/Voronoi diagram
Delaunay 三角网/Voronoi图
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条