頂點的 的英文怎麼說

中文拼音 [dǐngdiǎnde]
頂點的 英文
apical/climactic
  • 頂 : i 名詞（人體或物體的最上部） crown; peak; top Ⅱ動詞1 （用頭支承） carry on the head 2 （從下面拱...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 的 : 4次方是 The fourth power of 2 is direction
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  1. Establish the adjacency relation among all pairs of components which share a pair of pseudovertices.

    在所有共享一對偽頂點的二個分量間建立相鄰關系。
  2. Smooth - smooths out a mesh by moving each vertex towards the barycenter of the linked vertices

    光滑-通過向連接頂點的重心移動每個頂點來光滑一個網格物體。
  3. The condensation of d is a directed graph with m vertices.

    D的凝聚圖是指一個有m個頂點的有向圖。
  4. Some features of boundary vertices of coronoid systems

    冠狀系統的邊界頂點的特徵
  5. If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph.

    如果邊都是頂點的有序對，則得到有向圖和有向重圖的概念。
  6. Let xkv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by a edges ( z, y )

    設k _ v是有v個頂點的完全多重圖，其中任意兩個相異頂點x和y都由條邊（ x ， y ）相連。
  7. A complete multigraph of order v and index a, denotes by xk, is a graph with v vertices, where any two distinct vertices x and y are jointed by a edges ( x, y )

    設k _ v是有v個頂點的完全多重圖，其中任意兩個相異頂點x和y都由條邊（ x ， y ）相連。
  8. Polyhedra with seven vertices are rare.

    具有七個頂點的多面體是稀少的。
  9. A star is defined as the set of edges incident to a vertex.

    一個星形定義為關聯于某個頂點的邊的集合。
  10. Up to isomorphism, there is just one complete graph on vertices.

    在同構意義下，幾個頂點的完全圖只有一個。
  11. The dominate set with minimum vertices number is the minimum dominate set of g

    所含頂點的個數達到最小的控制集叫做g的最小控制集
  12. We use 7 ( g ) to denote the vertices number of minimum dominate set, if r ( g ) < k, g is k ~ dominated

    G的最小控制集中頂點的數目用葉p ）來表示，當人g ） sk時， g叫做k控制的
  13. Institute of computer science, the hebrew university, 1999. 13 ofek e, rappoport a. interactive reflections on curved objects. in computer graphics siggraph 98 proceedings, orlando, fl, usa, 1998, pp. 333 - 342

    因為虛物體上所有頂點的計算過程實際上是一個simd single instruction multiple data的并行處理過程，我們利用可編程圖形處理單元gpu graphics process unit的并行計算能力來提高計算速度。
  14. Visually, it is slightly more appealing than pure vertex based animation, since the intermediate frames are filled in dynamically at run - time

    而在真實感上，它比基於頂點的動畫也要好很多，因為中間幀都是實時動態的計算出來的。
  15. And also, the number of key frames can be slightly lesser than what it would have been with pure vertex based animation

    因此，需要關鍵幀的數量較少一些，與基於頂點的動畫而言它干凈些。
  16. We define the weighted degree of v by if g has a k - independent set of vertices in g, then define independent set of vertices in g }

    頂點v的賦權度定義為若g有k個頂點的獨立集，則定義否則，令_ k ~ w = 。
  17. A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.

    一個構形是面圖的一連串連通的頂點與這些頂點的度。
  18. It is natural to extend this algorithm to 3d triangular mesh and output the texture coordinates for each triangle vertex

    該演算法可以自然擴展到三維三角網格，以三角面片作為合成單元，合成后直接輸出每個頂點的紋理坐標。
  19. These shortest paths can be easily determined by keeping track of the predecessors of vertices in the tree.

    只要在樹中沿著先行頂點的軌跡引伸，這些最短路徑還是容易確定的。
  20. Repeat the features of the faces, edges and points of a cuboid

    師：復述長方體面、棱、頂點的特徵。
分享友人
分享到 Line

分享到臉書