area triangulation 中文意思是什麼

area triangulation 解釋
面積三角測量
  • area : n. 1. 面積；平地；地面。2. 空地；〈英國〉地下室前的空地。3. 地區，地方；〈比喻〉區域；范圍。
  • triangulation : n. 三角測量；三角部分。 a net of triangulation 三角網。
  1. To solve the inaccuracy problem caused by the two existing methods ( average end - area method and prismoidal method ) used for the calculation of roadway earthwork volume, this paper puts forward a new concept of the 3 - dimensional algorithm that takes all the roadway geometric design procedures as a kind of geometrical operation between the ground model ( original terrain model ) and the roadway model ( designed model ) under certain constraints, and then presents a complete 3 - dimensional algorithm of roadway earthwork volume as well as its executable computer program. the algorithm benefits from the re - triangulation technique of constrained delaunay triangulation ( cdt ), which can yield a true volume value theoretically. through a number of practical tests covering varied intervals between adjacent cross sections, it is proven to possess a higher accuracy compared with that of traditional methods. all the work involved in this paper indicates that the 3 - dimensional calculation of roadway earthwork volume is feasible, more accurate and should have further application in practice

    針對目前廣泛使用的道路土方量計算方法平均斷面法和稜柱體法計算不準確的缺點，提出了三維土方量計算演算法的概念.該演算法以帶約束的狄羅尼三角化（ cdt ）為技術核心，認為所有道路幾何設計過程都是地面模型和道路（設計）模型進行幾何運算的結果.基於此，本文設計出相應的演算法步驟，同時完成了相應的軟體開發，使得該三維演算法能和傳統的方法進行對比.此外，結合工程實例，採用了不同的道路橫斷面間距對三維計算方法和傳統方法的誤差進行比較、分析.結果證明三維演算法具有更好的精度，該演算法可用於道路、場地平整等工程土方量計算
  2. 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 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  3. In addition, an extended curve constraint is presented to replace the original triangulation and parameterization techniques and instead of the bezier - shaped displacement reference, the basic function with parameters to control the deformation area and the magnitude are used to surface deformation

    其次，擴展了曲線幾何約束。舍棄了原有的利用三角剖分帶和局部參數化的方法，轉而利用基本函數定義的偏移曲線來生成表面的凸凹變形。
分享友人
分享到 Line

分享到臉書