hull generation 中文意思是什麼

hull generation 解釋
船型生成
  • hull : n 赫爾〈姓氏〉。n 赫爾〈英國港市〉。n 1 （果實等的）外殼；豆莢。2 漿果的花萼。3 薄膜，膜片；被覆...
  • generation : n. 1. 代〈約30年〉，世代，時代；同時代的人。2. 一代[一世]。3. 生殖，生育；發生，產生。4. 【數學】（面、體、線的）形成。5. 完善化階段，完善化方案，完善化的模型；發展階段。
  1. Generation of rectangular tile on ship hull

    船體曲表面敷設矩形塊生成演算法研究
  2. All algorithms that introduced hi my paper focus on the hollow hull of object, and the calculations are a series of intersection of face and line that have no ply. and by employing the topology information that come with the points since their generation, we can get the surface polygonal mesh without triangulation and reduce the time used in reconstruction of visual hulls and help to realize real - time rendering

    本文提出可見殼的生成演算法都是建立在無厚度的平面直線求交計算上，完全避免了對物體內部的冗餘區域的計算，同時利用物體表面點集與生俱來拓撲信息，恢復物體表面的多邊形網格，在一定精度范圍內可以避免對散亂點集進行三角剖分，減少可見殼的生成時間並有助於實時繪制的實現。
  3. Adaptive triangular mesh generation of ship hull surface based on nurbs

    的船體曲面自適應三角網格剖分
  4. 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

分享到臉書