頂點數據 的英文怎麼說

中文拼音 [dǐngdiǎnshǔ]
頂點數據 英文
primitive vertex texture and pixel information
  • : i 名詞(人體或物體的最上部) crown; peak; top Ⅱ動詞1 (用頭支承) carry on the head 2 (從下面拱...
  • : Ⅰ名詞1 (液體的小滴) drop (of liquid) 2 (細小的痕跡) spot; dot; speck 3 (漢字的筆畫「、」)...
  • : 數副詞(屢次) frequently; repeatedly
  • : 據Ⅰ動詞1 (占據) occupy; seize 2 (憑借; 依靠) rely on; depend on Ⅱ介詞(按照; 依據) according...
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  • 數據 : data; record; information
  1. In term of the control mechanism between tp and te, possibly, this special control method will provide the control theory some spark. based on the research and conclusion of the frog visual behavior, in term of the control mechanism among the tp, te and endbrain area, the author has done a detailed system analysis and use the computer 3d to simulate the frog vision behavior. this kind of visual behavior model could be taken as a good reference to study the formation of the vision and its characteristics

    文中通過對青蛙視覺行為的細致整理和總結,根丘腦-前蓋( tp ) ~ 1 、蓋~ 2和端腦區域里神經元集團之間的相互作用機制並結合具體的視覺行為,做了詳細的系統分析,並在此基礎上,使用計算機3d技術對青蛙視覺行為進行了模擬,這種直觀的視覺行為模型能夠為我們進一步研究視覺的形成和特提供良好的依和借鑒。
  2. The paper will study the upper questions based on the two interconnection networks. first, we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second, with the rapid progress in vlsi, the failing probability of processors and links is very low, the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary, we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time, the result is the same as the hypercube. we also give a related algorithm in o ( n ) time, and the length of the longest path ; third, we apply cluster faun tolerance introduced by q. - p

    menger定理, n -維交叉立方體可以容納n - 1個故障,我們給出了它的時間復雜度為o ( n )的容錯路由選擇演算法及其最長路徑長度分析;在此基礎上本文證明, n -維交叉立方體的條件連通度為2n - 2 ( n 2 ) ,並給出了相應時間復雜度為o ( n )的演算法及其最長路徑長度;除此之外,本文還證明當n -維交叉立方體中的故障簇個不大於n - 1 ,其直徑不大於1 ,故障不超過2n - 3 ( n 2 )時,交叉立方體中任兩個無故障都至少有一條可靠路徑。
  3. A new model of distribution system is presented, whereby, the feeder switches are regarded as the vertcxes of a graph and the feeder lines are regarded as the arcs. the method to model distribution networks by adjacent table is put forward. therefore, storage size is reduced and calculation is speeded up

    建立了配電網的簡化模型,即將饋線開關當作圖的、將饋線當作弧,採用等長鄰接表的結構來描述配電網,大大減少了佔用空間和提高了查詢速度,並建立了基於等長鄰接表的配電網路拓撲演算法。
  4. The authoritative data for a zone is simply all of the rrs attached to all of the nodes from the top node of the zone down to leaf nodes or nodes above cuts around the bottom edge of the zone

    給區域的授權僅僅是附加到從區域下面到葉節或者在分割底部區域邊緣上面的節的所有節的rr 。
  5. American journal of botany, 2003, 90 : 333 - 338. 19 fougerolle y d, gribok a, foufou s, truchetet f, abidi m a. boolean operations with implicit and parametric representation of primitives using r - functions

    在此,超形的表面以所允許的精度進行采樣生成,而它們的和面片將根隱函的刻畫來決定它們是否用於最終實體表面的生成。
  6. In chapter 3, for the case that the terrain data can not fit in memory, we describe a data layout technique of providing coherent access to the terrain data that are consistent with our mesh simplification. we reorder the data in a manner that is of multiresolution and the overhead is completely eliminated

    第三章中,為了能處理超出內存容量的地形,我們對海量地形進行了重新組織,設計了一種基於層次二叉樹的遍歷方式的存儲方式,存儲的頂點數據是多解析度組織的,並且沒有冗餘。
  7. That contains the vertex data associated with the mesh

    ,它包含與網格相關聯的頂點數據
  8. Locks, sets, and unlocks a range of vertex data

    鎖定、設置和取消鎖定某一范圍的頂點數據
  9. Primitive, vertex, texture, and pixel information

    圖元頂點數據
  10. That indicates the type of vertex data the buffer holds

    ,指示緩沖區容納的頂點數據的類型。
  11. Using fixed - point vertex data

    >使用定頂點數據
  12. Describes how you can use fixed - point vertex data to increase performance

    描述如何使用固定頂點數據來提升性能。
  13. Locks a range of vertex data and returns the vertex buffer memory

    鎖定某一范圍的頂點數據,並返回緩沖區內存。
  14. Locks a range of vertex data and obtains the vertex buffer memory

    鎖定某一范圍的頂點數據,並獲取緩沖區內存。
  15. Supports rendering of primitives using vertex data stored in vertex buffer objects

    支持使用在緩沖區對象中存儲的頂點數據來呈現基元。
  16. To prevent the system from copying vertex data not affected by the vertex operation into the destination buffer

    可以阻止系統將不受操作影響的頂點數據復制到目標緩沖區中。
  17. Applies the vertex processing defined by the vertex shader to the set of input data streams, generating a single stream of interleaved vertex data to the destination vertex buffer

    著色器定義的處理過程應用到輸入流組,從而生成從插入的頂點數據到目標緩沖區的單個流。
  18. In chapter 2, we discuss the terrain modeling with continuous level of detail, described a data layout technique for manage out - of - core datasets. then, we investigate the opengl based nv extension for fully taking advantage of the accelerating function of graphic hardware and improving the capability of rendering

    該框架還有效地利用了nvidia的opengl擴展gl _ nv _ vertex _ array _ range和gl _ nv _ fence來對場景的渲染進行加速。它們能夠讓幾何圖形高效地傳輸到gpu , gpu直接訪問頂點數據,使得應用程序的執行效率極大提高。
  19. By the algorithm ccn, we investigate the crossing numbers of regular graphs with small order. we get the crossing numbers of 3 - regular graphs for n < 16 and 4 - regular graphs for n < 12, and the lower bounds of the maximum crossing numbers of 3 - regular graphs for n < 30 and 4 - regular graphs for n < 19, where n is the order of graphs. according to the result, we put forward the conjecture about the maximum crossing numbers of regular graphs

    本文還利用演算法ccn ( calculatecrossingnumber )對較小的正則圖的交叉進行研究,計算出n 16的三正則圖和n 12的四正則圖的交叉,以及n 30的三正則圖和n 19的四正則圖的最大交叉的下限( n為圖的) ,根計算結果提出關于正則圖最大交叉的猜想。
  20. You can use fixed - point vertex data to increase the transforming and lighting speeds of 3d graphics drivers that do not implement transforming and lighting in hardware

    您可以使用定頂點數據來提高那些未在硬體中實現幾何形變和光效處理的三維圖形驅動程序的幾何形變和光效處理速度。
分享友人