grid intersection 中文意思是什麼

grid intersection 解釋
網格交叉點
  • grid : n 1 格子，格柵。2 （蓄電池的）鉛板。3 【無線電】柵級。4 鐵道網；【電學】電力網；〈英國〉（全國）...
  • intersection : n. 1. 橫斷，橫切；交叉，相交。2. 【數學】交集。3. 交點，交叉線，十字路口。4. 邏輯乘法。
  1. Perfect pre - processing and post - processing function is one of the main factors to evaluate the vitality and market value of the finite element analysis system surveying today development of finite element analysis technology, most of which concentrate on establishing fine user interface, also has some limitation on application, and especially, the research on the visualization of arbitrary cut - plane is always in ascendants to realize the visual processing on cut - plane needs reprocessing the results of finite element analysis which have get, so the algorithm is two parts : seeking the physical value of cut - plane and drawing 2d contours, the former, based on the theory of stress on " arbitrary inclined plane " in physical mechanics, use the method of linear interpolation method to get the coordination and physical value of intersection between cut - plane and element arris ; the latter, based on the tables on elements, nodes, stress and strain, summarize a rapid algorithm of generating 2d contours based on the grid. this thesis synthesizes there two parts and get a visual processing program under fortran

    縱觀有限元分析技術的發展，目前大多集中在建立良好的用戶界面上的研究仍存在許多應用上的局限性，其中對任意剖面上可視化的研究仍處于方興未艾的階段。要實現任意剖面上可視化處理，必須先將得到的有限元計算結果進行再處理，因此在演算法上分為兩部分：求任意剖面上物理量值的演算法及二維等值線演算法。前一部分以彈性力學中「任意斜截面的應力」為理論基礎，利用線性插值方法得到截面與單元棱邊的交點坐標及交點物理量值；在此基礎上；根據已得到的單元及節點序號表、應力應變物理量表，總結出一種基於有限元剖分網格的快速生成二維等值線的演算法。
  2. The integral area ' s shape can be arbitrary, its shape is the intersecting part of physical grid and mathematics grid, so, the generation of integral area of unit is an intersection operation of two polygons

    摘要由數學覆蓋和物理網格形成的流形單元的積分區域可以有任意形狀，其形狀為物理網格和數學網格的相交部分，所以流形單元積分區域的形成為兩個多邊形（數學網格和物理網格）的求交運算。
  3. Different from realms, dual grid adopts finite precision rational coordinate system, which can express intersection points exactly. therefore, the complexity of spatial redrawing can be avoided, and spatial management subsystem can be implemented easily

    與realms不同，雙網格使用了有限精度的有理數坐標系統，能夠準確表示線段的交點，從而避免了復雜的空間調整，使空間管理子系統易於實現。
  4. The screen buffer is an attribute of the console, and is organized as a rectangular grid of rows and columns where each grid intersection, or character cell, can contain a character

    屏幕緩沖區是控制臺的一個屬性，以由行和列組成的矩形網格的形式進行組織，其中每個網格交叉位置（字元單元格）都可包含一個字元。
  5. Terrain only extends to the nearest grid intersection ( or other terrain - specific marker ) to the artwork

    地形效果只延伸到最近的方格交叉點（或其它地形特殊標記） 。
  6. For example, wall art that goes a little bit beyond or not quite to a grid intersection means the wall goes exactly to the grid intersection

    比如，圍墻有一點點越過或差一點才到方格交叉點，圍墻效果都是剛好影響到方格交叉點。
  7. ( 1 ) presents a grid - based intersection algorithm of parametric surface and plane, which is characterized by effectiveness and conciseness, and has been successfully implemented in the rp data processing software

    所作的主要工作如下： （ 1 ）提出一種基於網格劃分的參數曲面與平面求交演算法。這種演算法簡單、實用，已成功地應用於基於cad模型直接分層的rp數據處理軟體中。
  8. 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分鐘提高到幾十秒鐘，從而成功解決了這一問題。
  9. This new approach adopts a grid - based line index algorithm which can facilitate the calculation of intersection points for lines, hence the speed of calculating nfp is significantly increased

    該演算法採用基於網格的線段索引方法來加快線段之間的求交計算，進一步提高了臨界多邊形求解的計算速度。
分享友人
分享到 Line

分享到臉書