重復三角演算法 的英文怎麼說

中文拼音 [zhòngfùsānjiǎoyǎnsuànfǎ]
重復三角演算法 英文
retriangulate
  • 重 : 重Ⅰ名詞（重量; 分量） weight Ⅱ動詞（重視） lay [place put] stress on; place value upon; attach im...
  • 復 : Ⅰ形容詞1 （重復） repeated; double; duplicate 2 （繁復） complex; compound Ⅱ動詞1 （轉過去或轉過...
  • 三 : Ⅰ數詞1. （二加一后所得） three 2. （表示多數或多次） more than two; several; many Ⅱ名詞（姓氏） a surname
  • 角 : 角Ⅰ名詞1 （牛、羊、 鹿等頭上長出的堅硬的東西） horn 2 （古時軍中吹的樂器） bugle; horn 3 （形狀像...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 重復 : 1 repeat; duplicate; reduplicate; iterate 2 repetition; reiteration; gemination; rerun; duplicati...
  1. This thesis gives a brief account of the basic theories of software engineering and computer graphics, of the data structure of individual component modeling, of the design of the software structure and of the method of realizing software. meanwhile, this thesis put more emphasis on the exploration of the arithmetic of the delaunay triangle network, nurbs curve integration, the filling - in arithmetic of triple - tree, and the arithmetic based on the scan - line arithmetic and the filling - in of complex section

    文章介紹了關于軟體工程學與計算機圖形學的基本理論及其各組件模型的數據結構、軟體結構設計與軟體實現的技術方法，並重點討論了基於約束條件的delaunay三角網格化演算法、 nurbs （非均勻有理b樣條）曲面擬合、三叉樹等值線填充演算法和基於掃描線的復雜剖面填充演算法。
  2. With the development of the network and the multi - processor system, the research, simulation and the impemeni of the system - level fault diagnosis which is the very important means to increase the reliability of the system, are becoming more and more important. on the system - leve1 fault diagnosis, based on the group theory of system - level fault diagnosis that has been put forward by pro f zhang, the paper constructs newly the theory bases, improves on the matrix method, reinforces and consummates group arithmetic of all kinds of test mode, for the first time, analyses and discusses the equation solution of all kinds of models, so al1 the consistent fault patterns ( cfp ) could be found, straightly and high efficiently, even if the sufficient and necessary condition of t - diagnosable is dissatisfied and the complexity of system - level fault diagnosis is greatly decreased, especialy in strong t - diagnosabl6 system. last the simulation system ' s function has been extended and the application hotspot and the development trend have been disscussed

    本人在張大方教授等人提出的基於集團的系統級故障診斷的理論基礎上，重新構建了系統級故障診斷的理論基礎，定義了系統級故障診斷測試模型的三值表示；改進了系統級故障診斷的矩陣方法，重新定義了測試矩陣、鄰接矩陣、結點對、結點對的相連運算、極大準集團和斜加矩陣，由此能直觀、簡便地生成集團和極大獨立點集；補充和完善了各類測試模型的系統級故障診斷的集團演算法，通過定義集團測試邊和絕對故障集，簡化了集團診斷圖，由此能較易地找到所有的相容故障模式，即使不滿足t -可診斷性，大大減少了系統級故障診斷的復雜度，尤其是對強t -可診斷系統；首次分析探討了各類測試模型的方程解決，由此從另一角度能系統地、高效率地求出所有的相容故障模式（ cfp ） ：擴充了系統級故障診斷模擬系統的功能，快速、直觀和隨機地模擬實驗運行環境，進行清晰和正確的診斷，同時提供大量的實驗數據用於理論研究，優化演算法和設計。
  3. After the discussion of the plane measurement, we continue the discussion about the important method of the stereo measurement, such as : the method of resolving the fundamental matrix, the method of recovering the fundamental matrix from the camera matrix, the method of recovering the 3d point based on the trigonometry

    在平面測量理論的基礎上，論文繼續討論了基於圖像的立體測量的重要方法? ?兩視圖立體重構。詳細研究了其中基本矩陣的演算法、由基本矩陣恢復攝像機矩陣的演算法、三角法恢復空間點的演算法等，在這之後給出了真實試驗結果。
  4. 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 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  5. This thesis seeks to validate an effective approach to the method of the triangulation form 3d scattered points. a low computational complexity and high mesh quality algorithm has great application merit in the research of computational geometry, surface reconstruction and visualization of 3d data

    低計算復雜度和高網格質量的三角剖分演算法在計算幾何、曲面重構及三維數據場可視化等研究領域中有著重大的應用價值。
  6. This paper emphatically researches some typical search algorithms based on block matching of motion estimation, such as 155, fss, tdl, cs and ds. aimed at questions existing in these algorithms, under the elicitation of man vision system, the author designs a new integrative pattem ( sdp ) ftom the bionic view, which shows a parallel processing idea of coarse location and accurate orientation, and then presents a new square - diamond search ( sds ) algorithm for block matching motion estimation. the results of experiment prove that not only the new sos is much faster than above traditional algorithms, but also its psnr and visual quality of the retrieval images are better than those of other algorithms, and as nearly good as that of fs

    本文重點研究了三步法（ tss ） 、四步法（ fss ） 、二維對數法（ tdl ） 、交叉法（ cs ）和菱形法（ ds ）等經典的基於塊匹配的運動估值演算法；針對它們存在的問題，在人眼視覺系統的啟發下，從仿生學的角度設計了一種新的綜合模板（ sdp ） ，它體現了粗定位和準確定位并行處理的思想，在此基礎上提出了一種新的用於塊匹配的搜索演算法?正方形?菱形搜索（ sds ）演算法；實驗證明：該演算法的搜索速度比fs 、 tss 、 fss 、 tdl 、 cs和ds都快，而且根據運動矢量恢復出的圖像在psnr和主觀視覺效果方面都和fs相當，比其它演算法要好。
分享友人
分享到 Line

分享到臉書