1) 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图映射的点云运动处理技术。
2) 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图;最后根据连通图,采用贪婪策略来得到最小生成树。
3) image mapping
图像映射
1.
In this passage, a new algorithm is carried out based on image mapping from planar to the surface of globe, which realizes movement of view angle in all directions.
基于图像映射(Image Mapping)的计算机场景浏览作为计算机虚拟现实的主要方法之一以其简洁的表达、高效的显示越来越被人们青睐。
4) image warping
图像映射
1.
Due to the proposed fast image warping method,the computational problems of the conventional algorithms were effective avoided.
介绍了一种无缝拼接的全景图像生成算法,由于采用了快速图像映射法,传统算法中存在的计算效率瓶颈问题得到有效改善。
5) the reflection of graphics
图形映射
6) bitmap mapping
位图映射
1.
By thinking of BV and ABV algorithm,taking the bit-parallelism scheme and adding the ideas of bitmap mapping and tuple space,this paper presents a new algorithm.
该文从位并行算法出发,比较分析了它的两种改进算法,通过引入位图映射及元组空间的概念,提出了一种新的改进算法,在时间复杂度与空间复杂度上都较位并行算法有很大提高并具有很好的扩展性。
2.
In this paper, by taking the Bit-Parallelism scheme and adding the ideas of bitmap mapping and tuple space, we present a new algorithm.
本文从位并行算法入手提出一种新的改进算法,通过引入位图映射及元组空间的概念,在时间复杂度与空间复杂度上都较位并行算法有很大改进并具有很好的扩展性。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条