頂點集 的英文怎麼說

中文拼音 [dǐngdiǎnjí]
頂點集 英文
vertex set
  • 頂 : i 名詞（人體或物體的最上部） crown; peak; top Ⅱ動詞1 （用頭支承） carry on the head 2 （從下面拱...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 集 : gatherassemblecollect
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  1. The cable stays converge to a single point on the apex of the tower.

    綱索在塔架頂部集中在一點。
  2. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  3. Renders the vertices as a collection of isolated points

    將頂點呈現為獨立的點的集合。
  4. The main context of this paper is to generalize some rigurous results of " critical exponents " from binary tree to k - nary tree. percolation on the trees is defined as follows. we write t = ( z, e ) for the bond percolation on the tree. we write z for the set of vertices of t. arid e for the set of its edges

    K分樹是一種特殊的樹，它是一種規則樹，具體的定義如下：圖t = （ z ， e ）稱為k分樹， （其中z表示點集， e表示邊集）是指除了一個點（稱為頂點） ，與k個邊相連（即該點的度為k ） ，其它各點均與k + 1個邊相連（度為k + 1 ） ，我們可以把該點記為，稱為第0代（或祖先） ，與該頂點相鄰的點稱為第一代。
  5. The main principles of this new approach are : 1 ) find out the track line segments for vertices of one polygon to another polygon ' s edges ; 2 ) get the enclosing polygon and internal clockwise loops that was formed by the track line segments, finally the result polygons are the final nfps

    該演算法的基本原理是： 1 ）求解多邊形頂點相對于另一多邊形的軌跡線； 2 ）求解軌跡線集合所形成的外包多邊形和內部順時針環，得到的多邊形即為臨界多邊形。
  6. A star is defined as the set of edges incident to a vertex.

    一個星形定義為關聯于某個頂點的邊的集合。
  7. So if shares in acme reach 115p by the end of june, the holder of the call option described above will exercise the option, and make the fund sell its acme shares at 110p

    因此，如果頂點集團股價在6月底達到115便士，那麼上文中提到的買入期權持有者將行使期權，迫使該基金以110便士的價格售出所持頂點集團股票。
  8. Following the characteristics of medical image segmentation, this paper proposed a new spline geometric deformable model ( sgdm ), which can be presented as a set of ordered vertices connected by edges

    摘要根據醫學圖像分割的特點，建立了一種樣條幾何形變模型，它表示為一個有序的用邊線連接的頂點集合。
  9. This paper studies the band percolation of the models of the triangle lattice and the hexagonal lattice. before we study the models of the triangle lattice and the hexagonal lattice, we will introduce period. let g = ( vc, ec ) be a connected graph, we write vg for the set of vertices of g and egfor the set of its edges, u e vc is a vertex, and v is the coordinate vector

    在介紹平面正三角形和正六邊形點格的邊滲流模型之前我們先引入周期的概念：設g = （ v _ g ， e _ g ）為連通圖其中v _ g ， e _ g分別為圖g的頂點集和邊集， u v _ g為的頂點， v為平面的坐標向量。
  10. Its vertices are located at all points of the form ( i1, i2 ) or each vertex has six neighbors. the six neighbors of the vertex v are the set of vertices the set of edges e the model of the hexagonal lattice the usual way to imbed the hexagonal lattice is such that its face are regular hexagons. the vertices are the points. the origin is in the center of one of the hexagons and the periods are (, 0 ) and ( 0, 3 )

    頂點集合為為整數邊的集合為相鄰}正六邊形點格模型為：平面是由正六邊形點格組成，它的頂點坐標為其中，原點在一個正六邊形的中心，周期為（ 3 ~ （ 1 / 2 ） ， 0 ）和（ 0 ， 3 ）我們可以把它在豎直方向壓縮1 3 ~ （ 1 / 2 ）倍使它成為周期圖。
  11. The euclidean 2 - connected steiner network problem is to determine the minimum - weight 2 - connected steiner network on a given set of points in the euclidean plane

    設p是歐幾里德平面上的一個有限點集， n是頂點集為v ，邊集為e的一個網路，如果p
  12. Basic graph is a graph for which basis set of matroid is consisting of vertex set. two vertexs are adjoining if and only if there are exactly p ( m ) - l commonality elements in their bases. thus it plays an important role in the further studying

    基圖是一個以擬陣的基集為頂點集的圖，使圖中的兩個頂點是鄰接的當且僅當這兩個頂點對應的基恰好有p （ m ） - 1個公共元。
  13. 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

    該演算法先初步確定無向圖的頂點集和邊集，然後通過考查頂點之間掌紋線的弧度、頂點之間掌紋線的條數和頂點之間的距離對頂點集和邊集進行了適當的修正。
  14. Petersen graph is well known in graph theory, a generalized petersen graph, denoted by f ( m, a ), is defined as follows : its vertex set is u u w, where u - { < / 0. ?, ? ? ? um - i ], w ? [ w0, wi, ? ? ? wm - i }, its edges are given by ( u ;, wi ), ( ui

    Petersen圖是圖論中我們熟知的圖，廣義petersen圖，記為p （ m ， a ） ，是有2m個頂點的圖，其頂點集為，邊有點對和給出，這里下標的運算都是在模m下的運算
  15. Top displacements get largest in structure under the concentrated load, and get smallest in structure under the uniform load

    結構頂點位移在頂點集中荷載下達最大，在均布荷載時最小。
  16. The ordered vertices form its vertex model, and its ordered edges form the edge model, both are integrated together by the continuities of the deformable model

    其有序的頂點集合組成頂點模型，有序的邊線集合組成邊線模型，兩者通過形變模型的二階連續性緊密地結合在一起。
  17. Based on the hoppe ' s progressive mesh generation algorithm, restrict the simplified mesh model ’ s vertices to the initial mesh model ' s vertex set, when refinement sequence is generated. this can reduce the information included in the refinement sequence

    在hoppe漸進網格生成演算法的基礎上，在生成細化序列時，將簡化網格模型的頂點局限於初始網格模型的頂點集合中，減少了細化序列所包含的信息。
  18. In these examples, the results indicate that moments of every floor are very close, and each story obviously has an inflection point except ground floor in ordinary frame under the concentrated load. the moments get larger from top floor to ground floor, and the columns of ground floor and side columns of the stories close to the top floor do not have inflection point in ordinary frame under the trigonometry load or uniform load

    結果表明，無轉換層時，頂點集中荷載下，各樓層的彎矩非常接近，除底層外，每層都有明顯的反彎點;而在倒三角荷載或均布荷載下，各樓層彎矩由上至下逐漸變大，接近頂端幾層的外柱和最底層柱均沒有出現反彎點。
  19. Structure deformations rely mainly on shearing deformation in structures above the transfer girders under the trigonometry load or uniform load, and rely mainly on linear deformation under the concentrated load

    轉換梁以上結構在頂點集中荷載下變形以直線形為主，在倒三角荷載和均布荷載下變形以剪切變形為主。
  20. For all p - claws in g, if the subgraph induced by vertices whose degree in p - claw is one has at least ( p - 2 ) edges, then we call g a k1, p - confined graph

    如果g中的任一個p -爪中的1度頂點集合的導齣子圖中至少有卜2條邊，則稱g是klfp受限圖
分享友人
分享到 Line

分享到臉書