vertex

常見例句

• A vertex with zero outdegree is called a sink.
  出度為零的頂點稱作收點.
• Vertex a is the initial vertex and b is the terminal vertext.
  a頂點是始端頂點,而b是末端頂點.
• An edge corresponds to a corridor and a vertex to the conjunction of several corridors.
  邊對應(yīng)于走廓,而頂點對應(yīng)于幾條走廓的相交點.
• Now we need a vertex buffer.
  現(xiàn)在我們需要一個頂點緩沖.
• A vertex with zero outdegree is called a sink.
  出度為零的頂點稱作收點.
• Up to 128 instructions can be encoded in a single vertex shader.
  指令的序列為128個操作長度.
• Set vertex streams and index buffer to the primitive.
  集流頂點和索引緩沖區(qū)的原始.
• Calculating local normals of vertex and polygons in an object and positioning another according to it.
  如果在另一個物體的頂點或面上放置物體.
• The intermediate vertex positions are computed dynamically using interpolation schemes such as linear , Hermite curve, etc.
  中間的頂點位置使用插值方法動態(tài)計算決定.
• An application programmer must supply a tangent, binormal, and normal at each vertex.
  程序員必須提供每個頂點的切線 、 副法線和法線.
• A leading vertex is the first vertex in a sequence of three vertices.
  引導(dǎo)頂點就是頂點序列中三個頂點的第一個.
• Objective : To analyze the aberration properties of contact lens and its central back vertex power measurement.
  摘要:目的: 探討接觸鏡的球差特征以及后頂焦距測量的實質(zhì).
• The second pair of triangles uses vertex indices 1,2 and 5, and then 2,5 and 6.
  第二對三角形的頂點索引設(shè)置為1,2,5和2,5, 6.
• Vertex coloring model and decomposing algorithm of gate assignment problem is offered.
  給出了停機位分配問題頂點著色模型及其分解算法.
• Unfortunately the answer is no , it's not currently possible to index the vertex components independently.
  不幸的是,這個問題的答案是不行.
• Step 2. Delete the single vertex at the top and bottom ends of the cylinder.
  第2步. 在圓柱體頂部和底部兩端刪除單個頂點.
• Vertex scan line number is the core concept of this algorithm.
  頂點掃描線號是該算法中的核心概念.
• Direct 3 D uses the vertex normals for Gourand shading, lighting, and texturing effects.
  Direct3D使用頂點法向量來實現(xiàn)Gourand渲染, 光照和紋理效果.
• A digital diopter measuring instrument is described for lens spherical vertex power and cylindrical axis measurement.
  本文論述了一種采用旋轉(zhuǎn)編碼器與莫爾條紋測長相結(jié)合進行眼鏡片的頂點屈光度.
• Also note that ( View x Projection ) matrix is per scene, not per vertex.
  請注意矩陣是個別場景, 不一個頂點.
• In general, the device capabilities for software and hardware vertex processing are not identical.
  通常, 軟件和硬件頂點處理的設(shè)備性能并不相同.
• The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
  得到了花圖的鄰點可區(qū)別全色數(shù).
• All the vertex streams for a given primitive are associated with one stream bank.
  所有的頂點流某一相關(guān)的原始流的銀行之一.
• The algebraic sum of the through variables associated with the edges to any vertex is zero.
  關(guān)聯(lián)于任一頂點的各邊所附帶的流通變量的代數(shù)和為零.
• The procedural programming model used by vertex shaders is very scalable.
  就程序上的規(guī)劃模型而言,頂點著色是絕對可升級的.
• If an appropriate vertex isn't found , the graph must have a cycle.
  如果沒有這樣的頂點, 則圖必然存在環(huán).
• Vertices are read from the vertex data stream and are sequentially processed by the shader function.
  從頂點數(shù)據(jù)流中讀出頂點后,就由著色器函數(shù)來對其進行處理.
• Can I use a custom vertex shader if my hardware does not support it?
  如果我硬件不支持VS, 我能使用VS 嗎 ?
• Each vertex in average distance of each radian located in circumference.
  各頂點相互以平均的弧度距離坐落在圓周上.
• Now we need a vertex buffer.
  現(xiàn)在我們需要一個頂點緩沖.
• A vertex with zero outdegree is called a sink.
  出度為零的頂點稱作收點.
• A star is defined as the set of edges incident to a vertex.
  一個星形定義為關(guān)聯(lián)于某個頂點的邊的集合.
• Set vertex streams and index buffer to the primitive.
  集流頂點和索引緩沖區(qū)的原始.
• Calculating local normals of vertex and polygons in an object and positioning another according to it.
  如果在另一個物體的頂點或面上放置物體.
• The intermediate vertex positions are computed dynamically using interpolation schemes such as linear , Hermite curve, etc.
  中間的頂點位置使用插值方法動態(tài)計算決定.
• An application programmer must supply a tangent, binormal, and normal at each vertex.
  程序員必須提供每個頂點的切線 、 副法線和法線.
• A leading vertex is the first vertex in a sequence of three vertices.
  引導(dǎo)頂點就是頂點序列中三個頂點的第一個.
• The second pair of triangles uses vertex indices 1,2 and 5, and then 2,5 and 6.
  第二對三角形的頂點索引設(shè)置為1,2,5和2,5, 6.
• There are two problems in 2 D shape blending: vertex correspondence and vertex interpolation path.
  二維形體漸變的研究包含兩個問題: 頂點對應(yīng)問題和頂點插值路徑問題.
• Vertex coloring model and decomposing algorithm of gate assignment problem is offered.
  給出了停機位分配問題頂點著色模型及其分解算法.
• Step 2. Delete the single vertex at the top and bottom ends of the cylinder.
  第2步. 在圓柱體頂部和底部兩端刪除單個頂點.
• Vertex scan line number is the core concept of this algorithm.
  頂點掃描線號是該算法中的核心概念.
• Direct 3 D uses the vertex normals for Gourand shading, lighting, and texturing effects.
  Direct3D使用頂點法向量來實現(xiàn)Gourand渲染, 光照和紋理效果.
• A digital diopter measuring instrument is described for lens spherical vertex power and cylindrical axis measurement.
  本文論述了一種采用旋轉(zhuǎn)編碼器與莫爾條紋測長相結(jié)合進行眼鏡片的頂點屈光度.
• Also note that ( View x Projection ) matrix is per scene, not per vertex.
  請注意矩陣是個別場景, 不一個頂點.
• In general, the device capabilities for software and hardware vertex processing are not identical.
  通常, 軟件和硬件頂點處理的設(shè)備性能并不相同.
• All the vertex streams for a given primitive are associated with one stream bank.
  所有的頂點流某一相關(guān)的原始流的銀行之一.
• The algebraic sum of the through variables associated with the edges to any vertex is zero.
  關(guān)聯(lián)于任一頂點的各邊所附帶的流通變量的代數(shù)和為零.
• This tool inserts a vertex at the point on the shape where the cursor lies.
  這個工具,可以在形狀中的游標處增加頂點.
• The procedural programming model used by vertex shaders is very scalable.
  就程序上的規(guī)劃模型而言,頂點著色是絕對可升級的.
• If an appropriate vertex isn't found , the graph must have a cycle.
  如果沒有這樣的頂點, 則圖必然存在環(huán).
• Vertices are read from the vertex data stream and are sequentially processed by the shader function.
  從頂點數(shù)據(jù)流中讀出頂點后,就由著色器函數(shù)來對其進行處理.
• Each vertex in average distance of each radian located in circumference.
  各頂點相互以平均的弧度距離坐落在圓周上.
返回 vertex