vertex
- 1. In this architecture, all data for each vertex must be available at the same time.
- 在这一架构中,来自各顶点的所有数据都必须同时可用。
youdao
- 2. Because one vertex can only have one normal, you must duplicate the vertices as well.
- 由于一个顶点只能有一条法线,所以你还要复制顶点。
youdao
- 3. In the first feasible region above, the optimal solution is the right vertex of the solution space.
- 在上面的第一个可行域中,优化解决方案是解析空间中的右顶点。
youdao
- 4. If the horizontal line drawn is aligned with a polygon vertex, then only the segments that are below the line are counted.
- 如果所绘制的水平线与一个多边形顶点对齐,那么只计算位于该线下方的部分。
youdao
- 5. The vertex positions are not enough.
- 仅有顶点位置还不够。
youdao
- 6. In prognathous insects, the vertex is not found between the compound eyes.
- 下巴突出的昆虫的复眼之间没有顶点。
youdao
- 7. A vertex tree is built to represent the data structure of the models by octonary subpision.
- 以八叉剖分来建立一棵顶点树,用以表示整个网格模型的数据结构。
youdao
- 8. The portal protein that forms the unique DNA entrance vertex of prohead.
- 门脉蛋白形成了独特的DNA前头的入口点。
youdao
- 9. Listing 4 shows how to use vertex colors.
- 清单4示范了使用顶点颜色的方法。
youdao
- 10. Vertex Pharmaceuticals -- up 256%... and counting!
- 顶点药品 ——涨幅: 256%
youdao
- 11. Try not to use lights at all, even vertex lights.
- 尽量不使用所有的灯光,即使是顶点灯光。
youdao
- 12. For example, vertex 0 is defined as position (-1, -1, 1).
- 例如,顶点0定义为坐标(-1,- 1,1)。
youdao
- 13. This happens if the graph is disconnected or has a cut vertex.
- 如果一个图是不连通的或有割点,就发生这种情况。
youdao
- 14. In the class member section, I define each vertex color in VERTEX_COLORS.
- 在类成员部分的VERTEX_COLORS中定义了各顶点颜色。
youdao
- 15. Each face is an equilateral triangle and three faces meet at each vertex.
- 每一个面是正三角形并且于每一个顶点处有三个面相交。
youdao
- 16. Start with a vertex, put it in the tree. Then repeatedly do the following.
- 从一个顶点开始,把它放到树的集合中。然后重复做下面的事情。
youdao
- 17. For each vertex, a texture coordinate defines which texture position will be used.
- 对于每个顶点而言,纹理坐标定义了使用纹理的位置。
youdao
- 18. Per-vertex dynamic lighting can add significant cost to vertex transformations.
- 逐像素的动态光照将对顶点变换增加显著的开销。
youdao
- 19. At first we need to get normals for each triangle vertex, but how to achieve this?
- 首先我们需要对每个三角形顶点法线,但如何实现这一目标?
youdao
- 20. By now, you have probably guessed that I'll introduce yet another per-vertex attribute.
- 现在,您或许已经猜测到我将引入另外一种每个顶点都具备的属性。
youdao
- 21. This way, not every person will be able to read and modify your vertex shader source.
- 使用这种方法,就不是每一个人都可以看到你的顶点着色源文件了。
youdao
- 22. In flat-shading mode, you use the color of a triangle's third vertex across the whole triangle.
- 在平面着色渲染模式下,可用三角形的第三个顶点颜色为整个三角形着色。
youdao
- 23. So far, I've shown you two ways of changing your cube's appearance: vertex colors and materials.
- 至此,我已经介绍了更改立方体外观的两种方式:顶点颜色和材质。
youdao
- 24. Graphics CARDS without hardware vertex processing, common on cheaper laptops, do not appear to work.
- 显卡如果不具有硬件顶点处理能力(便宜的笔记本电脑通常安装这样的显卡),就不能正常工作。
youdao
- 25. It chases vertex after vertex through the different processing steps until each one reaches the screen.
- 它逐个地对各顶点进行一系列的处理,直至各顶点都显示在屏幕上。
youdao
- 26. This is, in all the time I've been doing software, the only five-dimensional vertex case I've ever seen.
- 在所有的时间里,我一直在做软件,所以我只见过五维顶点案例。
youdao
- 27. The three vertices of the iron triangle collapse into one vertex of the Agile triangle called constraints.
- 传统铁三角的三个顶点转变为“敏捷三角形”的一个顶点,被称为约束。
youdao
- 28. The driver might allocate a larger buffer after this point, or you might need to reduce your vertex count.
- 在这点之后,驱动可能会分配一个更大的缓存,或者你可能需要降低你的顶点数量。
youdao
- 29. Vertex colors and, as you'll see later, textures don't need light; they will always display in the defined color.
- 顶点颜色和后面即将介绍的材质是不需要光线的,它们永远显示为定义好的颜色。
youdao
- 30. The algorithm works because if a vertex has no successors, it must be the last one in the topological ordering.
- 算法能够执行是因为,如果一个顶点没有后继,那么它肯定是拓扑序列中的最后一个。
youdao