相鄰頂點 的英文怎麼說

中文拼音 [xiānglīndǐngdiǎn]
相鄰頂點 英文
adjacent vertex
  • 相 : 相Ⅰ名詞1 （相貌; 外貌） looks; appearance 2 （坐、立等的姿態） bearing; posture 3 [物理學] （相位...
  • 頂 : i 名詞（人體或物體的最上部） crown; peak; top Ⅱ動詞1 （用頭支承） carry on the head 2 （從下面拱...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 相鄰 : adjoin; adjoining; adjacent
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  1. Establish the adjacency relation among all pairs of components which share a pair of pseudovertices.

    在所有共享一對偽頂點的二個分量間建立相鄰關系。
  2. Let u and v be nonconsecutive vertices on c.

    設u和v是c上不相鄰的兩個頂點。
  3. 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代（或祖先） ，與該頂點相鄰的點稱為第一代。
  4. A k - role assignment of graph is an assignment of role, if g is a graph, a k - role assignment is a surjective function mapping each vertex into a positive integer 1, 2. . . k, so that if x and y have the same role, then the sets of roles assigned to their neighbors are the same

    -角色分配就是一個角色分配，也稱為角色染色。 g是一個圖， -角色分配就是把圖上各頂點映到正整數{ 1 ， 2 ， … ， }的一個滿射函數，它滿足：如果x和y有相同角色，那麼與之相鄰接的點的角色集合也相同。
  5. 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 ）倍使它成為周期圖。
  6. Abstract : a new data structure that one link - list was composed of polygon - surface table, edge table and vertex table was proposed to describe the geometry information and topology information of control polyhedron m in the rese arch of modeling with closed surface. compared with other structures which were a pplicable to the work, the structure was understandable, economize and conveniently to modify. after describing the detail of the geometry information, topology inf ormation included in the tables of polygon - surface, edge and vertex, and the poin t - link form of the adjacency multilist between the tables, a concise instance was given in clanguage array

    文摘:介紹了在閉曲面造型研究中，為描述控制多面體m的幾何信息和拓撲信息而設計使用的一種單鏈三表的數據結構.與其他適用與描述控制多面體的數據結構相比，該結構在結合了鄰接多重表方法后的特點是:關系描述清楚，節省存儲空間，方便查找和交互修改形體.在介紹單鏈中三表（面表、邊表、頂點表）所含的幾何信息細節、以及單鏈的三表之間的表示面、邊、頂點拓撲關系的指針的鄰接多重連接方式之後，本文給出了以c語言數組方式簡明描述的數據結構實例
  7. Everett and borgatti introduced the concept : k - role assignment of graph. if g is a graph, a k - role assignment is a surjective function mapping each vertex into a positive integer 1, 2. . . k, so that if x and y have the same role, then the sets of roles assigned to their neighbors are the same

    對于圖g ，它的一個k -角色分配就是由各頂點映到正整數1 ， 2 ， … ， k的一個函數，它滿足：如果x和y有相同角色，那麼分配到它們鄰接點的角色的集合也相同。
  8. ( 2 ) if the maximum degree of any pair of nonadjacent vertices is at least, then g can be partitioned into k subgraphs hi which hi is a cycle or a path ( 1 i k )

    （ 1 ）如果任何一對不相鄰頂點的度和至少為n k ，則g能被剖分成k個子圖從（二三卜k ） ，其中從是圈或路
  9. The label of a vertex in g ( w ) is the sum of the weight of its incident edges

    在網路g （ w ）中，各頂點的標號為與該頂點相鄰各邊的權之和。
  10. The adjacent vertex - distinguishing total coloring of some classes of graphs

    幾類圖的相鄰頂點可區別的全染色
  11. For every point on contour curves, the support area and support radius were first calculated based on actual distance of adjacent pixels, end points were obtained with linear interpolation technique ; next, the distance between point and its centroid of support area was used as feature strength to determine feature points candidate ; finally, those points with local maximum feature strength were selected as vertices of polygonal

    摘要首先基於相鄰像素間的歐氏距離計算出輪廓曲線上每一點的支持區域及支持半徑，用線性插值得到支持區域的端點；然後求得支持區域的質心，以曲線上的點和其相應的支持區域質心之間的距離作為特徵響應篩選出候選特徵點；最後將具有局部極大特徵強度的點作為多邊形的頂點。
分享友人
分享到 Line

分享到臉書