d ray-tracing 中文意思是什麼

d ray-tracing 解釋
三維射線跟蹤
  • d :
  • ray : n 雷〈姓氏，男子名， Raymond 的昵稱〉。n 1 光線，射線，熱線；〈詩〉光輝，閃爍，曙光，一線光明。2 ...
  • tracing : n. 追蹤，追溯，追查；描摹，映寫，復寫；摹圖；映寫圖，透寫物；示蹤，顯跡；【物理學】線路圖尋跡；自動儀表的記錄圖像。
  1. D ray - tracing

    三維射線跟蹤
  2. The result can be long distance reception of radio waves that would normally have been far beyond the radio horizon. the equations for ray tracing were given, simulating and tracing electro - magnetic wave duct propagation using spherical layered atmosphere mode, this method is very useful for analysis of radar echo distribution and confirm relation of stratification of atmosphere and ray duct propagation in the process of studying radar second product, introduce a new 3 - d interpolation method. outcome of this method can suit all kinds of density product

    在雷達二次產品處理演算法中，討論了一種新的三維插值，比以往在顯示每一個雷達二次產品時，都作一次插值相比，這種方法既節省了總的機時，也提高了每個產品的顯示速度，在討論這種方法后，用幾個產品的實例，說明了這種方法是可行的，並且還討論了等值線的生成原理，在「雷達二次產品處理平臺」下，開發了visualc + +實現程序。
  3. It can be used in any complex environment, can locate all paths from transmitter to receiver which avoid redundant calculation, and it is a standard 3 - d forecast model ; in addition, it is a point to point ray tracing method based on specular theory which do n ' t carry out the receive test ; furthermore the model adopt the reverse arithmetic which exert the tree concept in data frame and establish a virtual fountain tree permanently, the proagmme can back - search the virtual fountain tree when it is running. these operation increase the calculate speed and it result in the higher receive efficiency and precision. the thesis design a programme to compare the prediction results based on ray tracing method of virtual fountain tree between the measurement results and prediction results based on the other transmittion models. the comparsion result indicate the new model is a better model

    它可應用於任何復雜的傳播環境中，能找到發射機到接收機之間的所有電波傳播路徑而無須冗餘的計算，是一種準三維的預測模型；另外，從本質上講，它仍然是一種基於鏡像理論的點對點的射線跟蹤法，所以它無須進行接收測試；而且由於採用了反向演算法，運用數據結構中多叉樹的概念，先確定需要計算的場點位置，找出所有能從源點到達場點的射線，並且可一次性建立一個虛擬源樹，以後每次的計算只要通過對該樹進行後序遍歷即可，大大提高了運算速度，因而有較高的接收效率與精度。本文對該模型進行了相應的模擬，並將其預測結果與實測結果以及基於cost231經驗性模型和基於強力射線跟蹤確定性模型的預測結果進行了比較，結果表明了該模型的優越性。
  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. Real - time ray tracing for planar scenes with non - linear refractions and reflections. chinese journal of computers, 2002, 25 : 923 - 929. 19 hanrahan p, mitchell d. illumination from curved reflectors

    最後的多次實驗結果也證明，本文提出的新方法能夠在最新的圖形處理硬體上繪制快速準確的隱式曲面反射折射效果。
  6. Investigation on two algorithms of 2 - d acoustic ray tracing

    二維聲線追蹤的兩種演算法研究
分享友人
分享到 Line

分享到臉書