conventional intersection 中文意思是什麼

conventional intersection 解釋
習用交線
  • conventional : adj 1 因襲的，傳統的。2 習用的；平常的，常規的；形式上的。3 約定的，協定的；會議的。n ism 依從俗...
  • intersection : n. 1. 橫斷，橫切；交叉，相交。2. 【數學】交集。3. 交點，交叉線，十字路口。4. 邏輯乘法。
  1. In some time - critical situation, continuous ssi is computation bottleneck of some solid modeling system. conventional approach for solving continuous ssi often uses intersection algorithm iteratively without taking the characteristic of the surface into account to simplify computation. the dissertation analyzes the intersect curve structure of continue surface, from the point of intersect curve ' s evolution, it describes the relationship between topology of offset surface intersect curve and topology transmit point ( ttp )

    等距曲面和運動曲面在cad cam領域中有著重要的應用，在一些時間敏感場合例如數控加工動態模擬，等距曲面和運動曲面等連續變化曲面求交運算已成為這些系統的計算瓶頸，連續變化曲面求交問題的通常解法是採用曲面求交演算法反復迭代計算交線，沒有考慮連續變化曲面交線之間的相似性進行求交簡化，效率上一直不能有很大的提高。
  2. The paper aims at the special measure demands of external trajectory test in the conventional weapon experiment range, which is based on gj - 321 precise tracking trajectory measure system and combined with relevant measure devices, puts forward a new thought ? etwork real - time intersection measure

    本文針對常規武器試驗靶場的外彈道試驗任務的特殊測量要求，以新一代精密跟蹤彈道測量系統為中心，結合其它相關測量設備，提出了完成試驗任務的一種測量思想? ?網路化實時交會測量。
  3. The conventional ways has low efficiency, which result in the application of overlap grid in moving - grid problem, which need re - disposes the interpolating connection in every step in time direction, is very difficult considering the computational efficiency. aim at the above problem in application of overlap grid, this paper using an new manner rooting in analysissitus to put forward a “ method of distinguishing points of intersection ” and develop corresponding computational soft, which could realize the automatic and shape - independent pre - disposal process for overlap grid. to deal with the problem of low efficiency for pre - disposal process in moving - grid, this paper bring forward the “ mosaic ” method and adt method which based on the huge memory of modern computer

    對于重疊網格在動網格應用中的計算效率問題，本文通過進一步研究插值信息的高速查詢方法，提出不同於傳統演算法思路，以現代計算機大內存為基礎，用計算機物理內存空間換計算時間的」 mosaic 」方法以及應用基於二叉樹數據結構的adt （ alternatingdigitaltree ）方法兩類方法，成功的將原處理時間提高了兩個數量級? ?即將網格規模在百萬量級的重疊網格預處理時間從傳統方法的耗時30 60分鐘提高到幾十秒鐘，從而成功解決了這一問題。
分享友人
分享到 Line

分享到臉書