1) k-vertex colouring
k顶点着色
2) k-vertex coloring
k-顶点着色
3) optimal k-vertex colouring
最优k顶点着色
4) vertex coloring
顶点着色
1.
Mind evolutionary computation is used in solving vertex coloring problem.
应用思维进化计算求解顶点着色问题,给出求解给定图的色数、最小着色的算法。
2.
Based on the principle of graph theory, the paper transforms the matching/storing problem of railway dangerous goods into vertex coloring problem.
应用图论的原理将危险货物的配放问题转化为对图的顶点着色问题。
5) vertex shader
顶点着色
1.
Based on current computer graphics hardware a technique is proposed for calculating irradiance environmental maps using vertex shader.
为了实现动态光照环境下辐照度环境纹理图的实时绘制,基于当前的通用图形硬件,提出了一种采用顶点着色器快速计算辐照度环境纹理图的方法。
2.
Facial behavior for ANPC is implemented by blending morph vertex shader(BMVS) technique in which the meshes of previously created animations,such as blinking,smile and visemes,can be blended to form new and unique animations on the fly and in real time.
用一种混合变形顶点着色(BMVS)技术实现ANPC的面部行为,该技术可以把各个行为动画,如眨眼、微笑、视位(visemes),混合形成整个面部行为动画。
6) vertex-coloring
顶点着色
1.
Then it is substituted in Burnside formula,all vertex-coloring formulas of the regular polyhedron are determined.
然后代入伯恩塞德公式,求得所有正多面体的顶点着色公式。
补充资料：顶点
①角的两条边的交点；锥体的尖顶。②最高点；极点：比赛的激烈程度达到了～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条