VERTEX in Chinese translation

['v3ːteks]
['v3ːteks]
顶点
vertex
capstone
apex
top
culmination
peak
a high point
the point
at the height
culminated

Examples of using Vertex in English and their translations into Chinese

{-}
  • Political category close
  • Ecclesiastic category close
  • Programming category close
Wings 3D is a subdivision modeler which can assign materials, vertex color, UV coordinates and textures.
Wings3D是一个细分建模,可以指定纹理,UV坐标,顶点颜色和材料。
All modern browsers support WebGL 2 which allows for a whole new level of 3D texture and object rendering, fragment depth, and vertex array objects.
所有的现代浏览器都支持WebGL2,它支持全新的3D纹理和对象渲染,fragment深度和顶点数组对象。
Normals of an object can be defined on per face or per vertex basis(we speak of face normal or vertex normal).
一个object的Normal可以定义为每个面或者每个顶点basis(也即是facenormal和vertexnormal)。
Unity3D supports two different types of shaders: suface shaders and fragment and vertex shaders.
Unity3D支持两种不同的shader:表面shader、片段和顶点shader。
We can see that a technique got two functions, one for the pixel shader and one for the vertex shader.
我们可以看到,一个technique有两个函数,一个是pixelshader,另一个是vertexshader。
A graph with 6 vertices and 7 edges where the vertex number 6 on the far-left is a leaf vertex or a pendant vertex.
一个有6个顶点和7条边的图,其中最左边标号为6的顶点是一个叶子顶点,或称终端顶点.
Sequoia's India fund reaches into Southeast Asia- alongside its recently-launched accelerate program- as does the most recent fund from Vertex Ventures.
红杉的印度基金进入东南亚-与最近推出的加速计划一样-与VertexVentures的最新基金一样。
Since it rose to a vertex, the return of investment may be less than 5%.
因为在它涨到一个顶点后,投资回报率可能少于5%。
(Remember, the height of a triangle runs from a vertex to the opposite side, at a right angle.).
记住,三角形的高是从一个顶点向对边作垂线,形成一个直角)。
A BST is called height-balanced according to the invariant above if every vertex in the BST is height-balanced.
如果BST中的每个顶点都是高度平衡的,则根据上面的不变量将BST称为高度平衡。
The mirror side vertex group must already exist(it will not be created automatically).
镜面一边的顶点组必须已经存在(它不会自动创建)。
In a directed graph, we have to further differentiate the degree of a vertex v into in-degree and out-degree.
在有向图中,我们必须进一步将顶点v的度数区分为度数和度数。
The algorithm starts by placing each vertex in a cluster of its own: v0, v1, and so on.
该算法首先每个顶点放置在它自己的聚类中:v0、v1等等。
The inclination of the deepest pit, in the direction from a vertex to the center, is approximately 8 degrees and 50 minutes.
最深的坑的倾斜,在该方向上从一个顶点到中心,大约为8度和50分钟。
A vertex may also have additional information, which we will call the“payload.”.
一个节点也可能有更多的信息,我们称之为“负载”。
A vertex whose degree is 0 is called an isolated vertex..
一个顶点的度如果是0,则被称为孤立顶点(IsolatedVertex).
Now, we will pick the vertex with the minimum distance, i.e., A and it will be included in the sptSet.
现在,我们将选择具有最小距离的顶点,即A,它将包含在sptSet中。
All vertex positions in NDC between -1.0 and 1.0 will not be discarded and end up visible.
所有位置在NDC下-1.0到1.0的顶点将不会被丢弃并且可见。
The heuristic function h(n) tells A* an estimate of the minimum cost from any vertex n to the goal.
启发式函数h(n)告诉A*估计从任何顶点n到目标的最小成本。
Not all attributes will be used for all vertices, e.g. the root vertex will have its parent attribute= NULL.
并非所有属性都将用于所有顶点,例如根顶的父属性为NULL。
Results: 155, Time: 0.0567

Top dictionary queries

English - Chinese