delaunay triangulation 中文意思是什麼

delaunay triangulation 解釋
德洛涅三角剖分
  1. Rectification and topology base on stl model is researched, too. the contour information is obtained by using slice technology ; the delaunay triangular meshes are generated by using delaunay triangulation algorithm and conglutinate precision of divided models is insured by using precise orientation technique. in addition, triangle scan is accomplished based on delaunay triangulation algorithm

    採用切片技術獲得了截面輪廓，用delaunay三角網格劃分演算法將截面輪廓網格化，用精確定位技術保證了模型粘接的精度；在delaunay三角網格劃分的基礎上，實現了快速原型的三角形掃描。
  2. Extracting terrain features from contour maps based on united - delaunay - triangulation model

    三角網的等高線地形特徵提取研究
  3. In this thesis, we study some mainstream surface reconstruction algorithms for unorganized data set and adopt the algorithms based on delaunay triangulation

    全局重建採用基於cocone方法的演算法，並為了檢測邊界而對此方法進行了改進。
  4. 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 ）為技術核心，認為所有道路幾何設計過程都是地面模型和道路（設計）模型進行幾何運算的結果.基於此，本文設計出相應的演算法步驟，同時完成了相應的軟體開發，使得該三維演算法能和傳統的方法進行對比.此外，結合工程實例，採用了不同的道路橫斷面間距對三維計算方法和傳統方法的誤差進行比較、分析.結果證明三維演算法具有更好的精度，該演算法可用於道路、場地平整等工程土方量計算
  5. 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樣條理論提出了一種由點雲數據構造旋轉面的方法，主要工作如下：計算機輔助幾何設計以及反向工程是本文的理論基礎，因此論文的第一章對其進行了簡短的回顧和綜述，並給出了旋轉面重建演算法目前的研究狀況。
  6. 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三角剖分，最後根據投影點上的鄰接關系確定三維點之間的連接關系。
  7. Finally, a multi - resolution reconstruction algorithm was proposed for optical tomography. in this algorithm, the delaunay triangulation rules are first used in the generation of the triangular mesh with

    該方法首先根據圖像的先驗信息，利用delaunay三角剖分規則，在整個成像區域形成疏密度不等的網格劃分，然後在此網格上實現ot圖像的多解析度重建。
  8. The advancing - front method and the delaunay method are studied here to fulfill the generation of 2 - d unstructured grid. the mesh is built and renewed by using delaunay triangulation method

    網格的劃分及更新採用delaunay三角化方法，網格內部節點的生成則是基於陣面推進法的思想。
  9. Algorithm of delaunay triangulation generation based on convex shell and twice optimization

    基於凸殼和二次優化的三角網生成演算法
  10. A new skeletonization algorithm based on constrained delaunay triangulation. in international symposium on signal processing and its applications, vol. 2, 1999, pp. 927 - 930

    基於以上操作，我們就能為一幅光柵圖生成基於dbsc的矢量表示，以進行高質量的繪制。
  11. This paper is about of arithmetic studys of triangulated irregular network which is published in abroad and home, and alter an arithmetic of delaunay triangulation using a uniform grid which was present by tsung - pao fang and les a. piegl of university of south florida. in this paper i present implementation details, test, examples of the arithmetic, moreover. a triangulated irregular network model of is built for geochemistry

    本文在前人研究的基礎上，探討和研究了國內外的不規則三角網生成演算法，通過理論和實驗選擇了tsung - paofang和les . piegl提出的delaunay三角網生成演算法作為數字地面模型的核心演算法，並對該演算法進行了改進和優化。
  12. 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三角剖分的健壯演算法。
  13. 8 ) the aas scheme has the property of maintaining the mechanical equation, smoothness controllable, has lifting scheme and easy, fast calculation. 9 ) in the processing of correlation visualization, the voronoi diagram and the delaunay triangulation had been introduced for the first time, and use them as the bases of defining the topology of the scattered load points, calculating the correlation and filling the color

    5 ）在將節點間的相關性進行三維可視化處理的過程中，首次引入了voronoi圖和delaunay三角形，作為確定散亂加載節點間拓撲關系、計算相關性和根據相關性大小填色的依據，實現了節點間的相關性的三維可視化。
  14. Algorithms based upon the delaunay triangulation are discussed. we also briefly survey some of the previous research on simplicial mesh generation

    我們考察了一些基於delaunay三角剖分的演算法，同時也簡短地回顧先前的一些簡單形網格生成演算法。
  15. A local adjustment algorithm for inserting constrained segments in delaunay triangulation

    三角網剖分中嵌入約束邊的局部調整演算法
  16. Algorithm study of the delaunay triangulation embedded constrained segments and 3d visualization

    三角網嵌入約束線段演算法的研究及三維可視化
  17. Lastly, an arbitrary bone model fracture simulation method based on delaunay triangulation is presented

    最後提出了一種基於delaunay三角剖分的骨骼模型的任意骨折模擬方法。
  18. Delaunay refinement operates by maintaining a delaunay triangulation, which is refined by the insertion of additional vertices

    Delaunay細化通過插入額外的點來進行細化，同時保持三角剖分的delaunay性質。
  19. Firstly, we introduced delaunay triangulation and developed a two dimensional delaunay triangulation program which can deal with large amount of data

    介紹了delaunay三角化的原理和演算法，開發了適用於海量數據的二維delaunay三角化處理程序。
  20. The mesh adaptation is performed by subdividing the cells using information obtained in the previous step of the solution and next rearranging the mesh to be a delaunay triangulation

    網格的自適應是通過先前的計算信息來對網格單元進行細分然後再對網格進行重新整理成delaunay三角剖分。
分享友人
分享到 Line

分享到臉書