triangulation point 中文意思是什麼

triangulation point 解釋
三角測點
  • triangulation : n. 三角測量；三角部分。 a net of triangulation 三角網。
  • point : n 1 尖頭，尖端；尖頭器具；〈美國〉筆尖；接種針，雕刻針，編織針；小岬，小地角；【拳擊】下巴。2 【...
  1. In this paper, we take the reconstruction of surface of revolution as our main aim, and by using the delaunay triangulation, the definition of curvature and the theory of b - spline, we present a way of reconstructing surface of revolution from point cloud. the main content of this paper is given in the following. computer aided geometric design and reverse engineering are the basis of this article

    本文以旋轉面重建演算法為主要研究對象，應用三角部分、曲率的定義以及b樣條理論提出了一種由點雲數據構造旋轉面的方法，主要工作如下：計算機輔助幾何設計以及反向工程是本文的理論基礎，因此論文的第一章對其進行了簡短的回顧和綜述，並給出了旋轉面重建演算法目前的研究狀況。
  2. In the mesh the local geometric and topological property can be clearly described with its adjacent points for a given point. then the delaunay triangulation technique in two dimensions is used to delete and modify the illegal triangles in the resulting mesh

    本文採用切平面作為曲面的局部近似，將局部的采樣點投影到切平面上，並對投影點集作二維delaunay三角剖分，最後根據投影點上的鄰接關系確定三維點之間的連接關系。
  3. We using the triangulation constructed from the point ' s adjacent field, which is the nearest to the original local surface, to compute the point ' s normal. it can get a good result

    本文採用了與局部曲面片最接近的由點的鄰域所構造的三角片來近似求點的法向量的方法，得到了較好的實驗結果。
  4. Based on data cloud, which is measured from 3 - coordinate measuring machine ( cmm ) or so, an algorithm to search lopological structure from 3d unorganized points using envelopment - box technology is proposed in this thesis. based on this method, we searching neighbor points of sampling point. we also improve the max - min angle criteria to realize local triangulation, and then get the normal of sampling point from the triangulation

    本文以測量得到的曲面數據點點雲為基礎，提出了一種基於包圍盒的自動尋找三維散亂數據點之間拓撲結構的方法，採用該方法尋找采樣點的鄰域結點，並對三角剖分中的典型優化準則?最小內角最大準則提出了改進，按照改進后的優化準則實現了采樣點的局部三角劃分，並進一步求解得到采樣點的法向量，依據法向量及鄰域拓撲關系在二次曲面的基礎上實現了散亂數據曲面重構中的數據點的自動分類。
  5. This paper also analyzed some key problems in 3d triangulation from scattered points. new determining principles for the relationship of point and line in space and for convexo - concave vertices of space polygon is discussed which corrected the previous method and can be applied in space triangle mesh. at the end of this papar, the future research areaes of triangluation from 3d scattered points are demonstrated

    本文還分析了三維空間直接三角剖分所要解決的一些關鍵問題，進而提出了空間中點與直線位置關系判別的新方法及空間多邊形頂點凹凸性判別的新方法，修正了以往演算法在應用上的局限性，使之能夠適用於復雜網格多邊形邊界。
  6. Two algorithms for delaunay triangulation from scattered points are suggested, one of which is from points in plane and the other from points in space. the problem of recognizability of 2d manifold is promoted and the relationship is pointed out between such recognizability and the local structure of a scattered point set

    提出並論證了兩種計算散亂點集delaunay三角剖分的方法，即平面點集delaunay三角剖分的局部構造演算法和空間點集delaunay三角剖分的健壯演算法。
  7. 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

分享到臉書