有序頂點表 的英文怎麼說

中文拼音 [yǒuxùdǐngdiǎnbiǎo]
有序頂點表 英文
ordered list of vertices
  • 有 : 有副詞[書面語] （表示整數之外再加零數）: 30 有 5 thirty-five; 10 有 5年 fifteen years
  • 頂 : i 名詞（人體或物體的最上部） crown; peak; top Ⅱ動詞1 （用頭支承） carry on the head 2 （從下面拱...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 表 : Ⅰ名詞1 （外面;外表） outside; surface; external 2 （中表親戚） the relationship between the child...
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  1. Dynamic indicates that the vertex buffer requires dynamic memory use, which is useful for drivers because it enables them to determine where to place the buffer

    表示頂點緩沖區要求動態使用內存，這樣對驅動程序有好處，因為這樣可以使驅動程序確定緩沖區的放置位置。
  2. Following the characteristics of medical image segmentation, this paper proposed a new spline geometric deformable model ( sgdm ), which can be presented as a set of ordered vertices connected by edges

    摘要根據醫學圖像分割的特點，建立了一種樣條幾何形變模型，它表示為一個有序的用邊線連接的頂點集合。
  3. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
分享友人
分享到 Line

分享到臉書