local triangulation 中文意思是什麼

local triangulation 解釋
局部三角測量
  • local : adj 1 地方的，當地的，本地的。2 局部的。3 鄉土的，狹隘的，片面的。4 【郵政】本市的，本地的；【鐵...
  • triangulation : n. 三角測量；三角部分。 a net of triangulation 三角網。
  1. 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三角剖分，最後根據投影點上的鄰接關系確定三維點之間的連接關系。
  2. An original mesh generation method based on the nc track points of tool surfaces is proposed here, the method can automatically generate meshes consisting of only quadrilateral elements, which is desirable for better accuracy and efficiency of simulation. besides, an automatic local coarsening algorithm for structured quadrilateral meshes is also developed. for arbitrary discrete points on auto body surfaces, an automatic triangulation method is adopted and a series of mesh optimization methods with given constraint conditions are proposed

    創新地提出了基於模具型腔表面nc數控軌跡點的全自動四邊形網格生成演算法，提出了結構化四邊形網格局部自動優化演算法，研究了基於車身曲面離散點的三角形網格自動生成演算法，並提出了給定約束條件的三角形優化演算法，探討性地研究了基於模具曲率半徑的板料初始網格局部自動細化演算法。
  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. 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三角剖分的健壯演算法。
  6. The definitions of flat surface triangulation, local separate sample and overall separate sample are given based on this discussion

    在此基礎上，給出了平展的曲面三角剖分、局部分離樣本以及全局分離樣本的定義。
  7. We have realized stable triangulation and striping methods in radm modeling system. triangulation method, which is based on delaunay triangle algorithm, has been improved on criterion of selected vertex, and striping used local optimize greedy algorithm

    我們在radm系統中以delaunay三角化為基礎，改進了頂點選擇的判據，並針對不同類型的多邊形採用不同的三角化策略，實現了穩定高效的三角化。
  8. A local adjustment algorithm for inserting constrained segments in delaunay triangulation

    三角網剖分中嵌入約束邊的局部調整演算法
分享友人
分享到 Line

分享到臉書