散亂數據點 的英文怎麼說

中文拼音 [sǎnluànshǔjùdiǎn]
散亂數據點 英文
unorganized points
  • 散 : 散動詞1. （由聚集而分離） break up; disperse 2. （散布） distribute; disseminate; give out 3. （排除） dispel; let out
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 據 : 據Ⅰ動詞1 （占據） occupy; seize 2 （憑借; 依靠） rely on; depend on Ⅱ介詞（按照; 依據） according...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 散亂 : debunching; all over the place; lie scattered
  • 據點 : strongpoint; fortified point; stronghold
  1. As it can be expressed easily by argument equations, we use the conicoid as the criteria of points " classification. based on the point ' s normal and the adjacent field, corresponding to the conicoid equation such as plane, ball and cylinder, we search the points that fit the equation along the adjacent field. using this method, we realized the automatic classification of unorganized points

    本文採用了可以比較方便地用參數方程表示的二次曲面作為數據點的分類標準，根據點的法向量以及其鄰域結點的各種屬性，對應于平面、球面、柱面等二次曲面，依據曲面方程的特點，從起始點開始沿鄰域深度優先遞歸尋找符合方程的數據點，實現了散亂數據點的自動分類。
  2. We use a size changeable adjacent field to describe the topological structure of 3d unorganized points in our algorithm. it can offer essential dynamic information for tessellation and points " normal

    演算法採用可以控制大小的鄰域作為空間散亂數據點的拓撲關系的幾何描述，為網格劃分和點的法向量的幾何描述提供了必要的動態幾何信息。
  3. Using the normal and neighbor relationship, classification of scattered data points is realized according to the quadric surface. the typical algorithms of surface reconstruction from 3d scattered data points are introduced, and then we discuss the current surface tessellation algorithms about their adaptive range, low efficiency

    本文首先對三維散亂數據點重構曲面的典型演算法和現有的曲面網格劃分演算法進行了分類與比較，針對現有的散亂點曲面重建演算法存在的低效率和局限性問題提出了相應的解決方案。
  4. This article in the unidimensional interpolation foundation, according to the different data ( grid data and scattered in disorder data ), divides the two - dimensional interpolation into the grid node interpolation and the scattered in disorder data interpolation, realizes the imagery processing and the data visualization with the matlab software

    摘要本文在一維插值的基礎上，根據不同的數據（網格數據和散亂數據） ，將二維插值劃分為網格節點插值和散亂數據插值，用matlab軟體實現圖像處理和數據可視化。
  5. A fast progressive surface reconstruction algorithm for unorganized points

    散亂數據點的增量快速曲面重建演算法
  6. An algorithm of searching topological structure from 3d unorganized points

    尋找三維散亂數據點拓撲結構的一種演算法
  7. Based on the theory of space dividing using envelopment - box, an algorithm to search topological relationship from 3d unorganized points is proposed in this thesis

    本文提出了一種利用包圍盒空間分割方法對散亂數據點點雲進行空間分割進而尋求拓撲關系的方法。
  8. A new algorithm is presented in this paper for piecewise quadric b - splines curve reconstruction from scattered data in a plane

    摘要基於控制頂點擾動的思想提出了一種新的曲線重構演算法，用於構造一條分段二次b樣條曲線來逼近平面上的散亂數據點。
  9. With this approach, the surface model can approximate inner scattered points and interpolate boundary conditions while keeping the global gl continuity. actually, the study on the theory and technology of b - spline surface reconstruction with complicated boundary constraints is an essential and innovative point of this thesis

    實際的運行例子表明，基於這種方案創建出來的曲面模型不僅能夠可調節性地逼近區域內部的散亂數據點，而且同時能夠插值于要求的邊界約束條件，從而保證整個曲面模型的全局g連續性。
  10. After the orderly reduction methods of massive scattered data being studied, this paper proposes a partial tangent plane slicing method and a virtual second - scan line method after giving a new k - nearest algorithm to re - organize the massive data. the new proposed methods of data reduction and grey theory based unusual noisy data process can be used to generate the scan line type data and it can be directly used to reconstruct curves and surfaces. the research lays a good foundation for reconstructing the cad model in a point - line - surface manner

    4 .深入研究了海量散亂數據的有序簡化技術，在提出建立海量數據點鄰接關系k -鄰近新的演算法基礎上，提出了局部切平面切片法和虛擬二次掃描線法，實現了海量數據的有序重組，通過基於灰理論的數據簡化和異常點處理新方法，生成可用於直接重構曲線曲面的掃描線類型數據，為以點?線?面方式重構cad模型打下了良好的基礎。
  11. The dividing process is recorded by octree, and then we make out the rapid adjacent - field searching algorithm using envelopment - box ' s recursion feature. this algorithm can also kick off some noise - points from the data cloud. it make the consequent process of surface reconstruction more convenience and precise

    分割過程採用八叉樹來記錄，並利用包圍盒的遞歸特性實現了點的鄰域的快速搜索演算法，同時可以有效地排除噪聲點，顯著減少了密集散亂數據點雲幾何建模所花費的時間，提高了建模效率。
  12. 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

    本文以測量得到的曲面數據點點雲為基礎，提出了一種基於包圍盒的自動尋找三維散亂數據點之間拓撲結構的方法，採用該方法尋找采樣點的鄰域結點，並對三角剖分中的典型優化準則?最小內角最大準則提出了改進，按照改進后的優化準則實現了采樣點的局部三角劃分，並進一步求解得到采樣點的法向量，依據法向量及鄰域拓撲關系在二次曲面的基礎上實現了散亂數據曲面重構中的數據點的自動分類。
  13. Weighted combination interpolation by piecewise quadric polynomial to scatter data points

    散亂數據點分片二次多項式加權平均插值
  14. Presents an algorithm of triangle mesh generation of disperse data points based on dynamic circles

    提出了一種基於動態圓的散亂數據點的三角網格生成演算法。
  15. A method is used to approximate several differential properties, including mean curvature, guassian curvature and main curvature on scattered - point - sampled surfaces

    摘要提出一種直接在散亂數據點雲上計算曲面的局部微分性質，包括平均曲率、高斯曲率和主曲率。
  16. Some instances indicate that this algorithm has greatly promoted the speed of using scatter data points to finish surface reconstruction, and really reconstructed surface model

    通過實例表明該演算法大大加快了散亂數據點群的重構速度，而且能夠較為真實的重構出曲面模型。
  17. The proposed algorithm is capable of handling with kinds of point clouds data, such as three dimensional unorganized point clouds, point clouds acquired from organized cad models or point clouds acquired from finite element analysis meshes

    本文所提出的演算法可以處理各種數據點雲，包括三維散亂數據點雲、規則cad模型離散后所獲得的數據點雲和由有限元網格採集到的數據點雲。
  18. Aiming at the existed problems in reverse engineering techniques concerning triangulation method for scattered data points, display technique of three dimension model based on mesh simplification, and redesign technique for re - constructed surface etc., this paper studies and proposes the relevant solving schemes, key algorithms and realizing technologies. the chief contributions acquired by this paper include : ( 1 ) an effective 3d triangulation algorithm for scattered data points is put forward. this algorithm solves the problem that data points must be partitioned for multi - projection realized by traditional 2d triangulation methods, and can also triangulate the scattered data points of trimmed surface and concave boundary surface

    本文工作針對散亂點集的三角網格劃分及優化、基於網格簡化的真實感模型顯示，以及重構曲面再設計等反求工程的關鍵技術中還存在的諸多問題，提出了相應的解決方案，並對關鍵演算法和實現技術進行了深入研究，論文的主要成果包括： （ 1 ）提出了一種有效的散亂數據點集的3d空間直接三角網格劃分演算法。
  19. Especially, in order to assure the smooth connection between the adj acent surfaces, the surface fitting algorithm of interpolating four boundary cur ves and approximating inner scattered data is presented, the surface fitting al gorithm of interpolating four boundary curves and cross boundary derivative v ectors and approximating inner scattered data is also presented

    特別地，為保證曲面間的光滑連接，提出了一種插值于給定邊界曲線且逼近內部散亂數據點的曲面擬合演算法：提出了一種插值于給定邊界曲線及其跨界導矢且逼近內部散亂數據點的曲面擬合演算法。
  20. We compare the b - spline curve interpolation and b - spline surface interpolation, analyze the fault of the b - spline curve interpolation and point out that we should use b - spline surface interpolation instead of b - spline curve to keep the continuity of the data result. also, we introduce the way to get control point from value point. then we propose the multi - step fitting of the dense and scattered data to construct b - spline surface, this algorithm perfectly resolve the obstacle of denseness and scattering of the contour line data

    第三章介紹了b樣條插值原理，論述了用b樣條曲面代替b樣條曲線對等高線進行插值，解決了線插值的不連續問題；並在b樣條曲面中運用了密集散亂數據點多步擬合演算法，解決了對等高線進行b樣條曲面插值中數據點散亂冗餘的問題。
分享友人
分享到 Line

分享到臉書