頂點度數 的英文怎麼說

中文拼音 [dǐngdiǎndùshǔ]
頂點度數 英文
degree of vertex
  • 頂 : i 名詞（人體或物體的最上部） crown; peak; top Ⅱ動詞1 （用頭支承） carry on the head 2 （從下面拱...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  • 度數 : number of degrees; readings; dimensionality; degree
  1. The indegree of a vertex v in d is the number of arcs with head.

    VD中頂點V的入度是指以V為頭的弧的數目。
  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. 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

    在此，超形的表面以所允許的精度進行采樣生成，而它們的頂點和面片將根據隱函數的刻畫來決定它們是否用於最終實體表面的生成。
  5. The indegree of a vertex v in d is the number of arcs with head

    V d中頂點v的入度是指以v為頭的弧的數目。
  6. As for the 3d modeling, the respondent modeling method is anglicized according to the characteristics of various sceneries. the simplicity of drawing method is proposed by combine the method of displaying list, terrain segmentation and vertex removing, which fulfilled the real - time display of a great scale terrain. as to the second problem, the quantitative relationship of view body and visual angle is deducted based on the theory of mathematics, which resolves the problem of aircraft pose display with better visual effect in simulation. these display the author ' s creative works

    在前者中，針對于各種景物的特點提煉出了相應的建模方法，並提出了將顯示列表、地形分割和頂點刪除法相結合的地形簡化繪制方法，實現了較大規模地形的實時顯示；在後者中，作者從數學角度推導出了視景體和飛行姿態角的定量對應關系，解決了飛行姿態顯示的問題，通過模擬，獲得了較好的視覺效果。
  7. Series of numerical examples are tested and the results are compared with that of some other algorithms

    在最小生成樹的基礎上，將超過度約束的頂點降低度數使之滿足度約束條件。
  8. The advantage is that it can be used to directly calculate the real physics quantities in an economic way. in this way, we need n ' t perform the analytical continuation from the result in the itf. this new rule has the following property ; the vertex is only related with the coupling constant and independent of the orientation of the momenta, one half of the vertex components vanish

    它的優點在於能直接計算與實際物理相關的觀測量，不用象虛時溫度場論中做計算后再作解析延拓，使得計算得到一定的簡化，並具有如下特點：頂角函數只與耦合常數相關，獨立於外線動量方向，而且一半的分量為零。
  9. The method first find the vertex aggregate and the edge aggregate primary, then revise them after checking the radian of the palm - line between two vertices, the palm - lines ’ number between two vertices and the distance of the vertices

    該演算法先初步確定無向圖的頂點集和邊集，然後通過考查頂點之間掌紋線的弧度、頂點之間掌紋線的條數和頂點之間的距離對頂點集和邊集進行了適當的修正。
  10. 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

    第三章中，為了能處理超出內存容量的地形數據，我們對海量地形數據進行了重新組織，設計了一種基於層次二叉樹的遍歷方式的頂點存儲方式，存儲的頂點數據是多解析度組織的，並且沒有冗餘。
  11. Neither eular circuit nor eular path exists in this graph, since there are more than two vertices with odd degree

    這個圖既沒有歐拉迴路，也沒有歐拉路徑。因為有超過兩個頂點的度數為奇數。
  12. A graph is regular if every vertex has the same degree.

    如果一個圖的每個頂點都具有相同的度數，則稱它是正則圖。
  13. This thesis contributes to directed cycles in digraphs, including the relations between the girth g ( d ) ( length of the shortest directed cycle ) of d and degrees of vertices of d and between the shortest directed cycle of d and the binding number of d, among which vertex - transitive digraphs are studied in detail

    本篇論文主要研究有向圖中的有向圈，討論有向圖中的圍長g （ d ） （最短有向圈的長度）與圖的頂點度以及結合數之間的關系，並重點分析了點可遷圖類。
  14. 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 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  15. The computational cost involved no longer increases exponentially with the number of vertices of the meshes to be fused. ( 2 ) the algorithm is robust as the ambiguity in graph structure combination is alleviated. ( 3 ) the detail of the cut mesh is fully kept

    與原有的基於全局調和映射的融合方法相比，新方法具有以下優點： （ 1 ）演算法效率大幅度提升，求解時間不再隨融合模型頂點數的增加而指數增長； （ 2 ）減少了二維網格拓撲合併中奇異情況出現的概率，提高了演算法的穩定性； （ 3 ）被剪切網格的細節得到完整保留； （ 4 ）消除了原演算法對融合區域拓撲的限制。
  16. The company says the burj will fulfill the chicago - based council on tall buildings and urban habitat ' s four criteria for the tallest building : the height of the structural top, the highest occupied floor, the roof ' s top, and the spire ' s tip, pinnacle, antenna, mast or flag pole

    公司宣稱，迪拜高塔將奉行芝加哥理事會制定的高層建築和城市人居的四重標準：結構性定點的高度、最高層數、屋頂高度、尖端高度、天線高度和旗桿高度。
  17. Retrieves or sets the fog density for pixel or vertex fog used in exponential fog modes

    為指數霧化模式中使用的像素或頂點霧化檢索或設置霧化密度。
  18. 3 ) b - spline surface fitting to contour data is studied. a fitting method of using uniform knot vector is given. using this method, the resulted b - spline s urface not only satisfy the requirements of precision, but also possess fewer c ontrol vertices and good fairness, the computation speed is greatly improved t oo

    3 ）研究了逐層掃描數據的曲面擬合問題，給出了一種是利用統一的節點矢量進行擬合的演算法，用該法得到的b樣條曲面不僅可以滿足精度要求，而且具有較少的控制頂點和較好的光順性，計算速度也有較大的提高。
  19. Combining one or more parameters of a graph, many papers either present some upper embeddable graphs ~ [ 7 - 14 ] that is to say, they present the graphs, whose maximum genus reaches the best upper bound, or, they give a better low bound on the maximum genus of some graphs ~ [ 15 - 31 ] the first major result of this paper is that : combining vertex partition and degree of vertices of graphs, to study the upper embeddablity of graphs

    結合圖的一個或多個參數，許多文獻都給出了若干上可嵌入圖類，即給出了最大虧格達到最好上界[ （ g ） 2 ]的圖類；或給出一些圖類的最大虧格的較好下界。本文的第一個主要結果，根據圖的頂點劃分和點的度的條件，研究圖的上可嵌入性。
  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

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

分享到臉書