鄰頂點 的英文怎麼說
中文拼音 [līndǐngdiǎn]
鄰頂點
英文
adjacent vertex-
Establish the adjacency relation among all pairs of components which share a pair of pseudovertices.
在所有共享一對偽頂點的二個分量間建立相鄰關系。Let u and v be nonconsecutive vertices on c.
設u和v是c上不相鄰的兩個頂點。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
建立了配電網的簡化模型，即將饋線開關當作圖的頂點、將饋線當作弧，採用等長鄰接表的數據結構來描述配電網，大大減少了佔用空間和提高了查詢速度，並建立了基於等長鄰接表的配電網路拓撲演算法。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代（或祖先） ，與該頂點相鄰的點稱為第一代。This fact led me to speculate that an axon could find its retinal cell neighbors in the tectum by homing in on chemical scents released by active tectal neurons, because its neighbors were most likely at the source of this trail
這讓我懷疑，軸突是否可以藉著活躍的頂蓋神經元釋出的化學物質，找到頂蓋里的視網膜細胞鄰居，因為它的鄰居最有可能就在這條路的起點。To efficiently reconstruct the topological structure of a large number of stl ( stereolithography ) data, the integrating vertex algorithm of the avl tree based on the v - f structure is promoted to delete a large number of repeated vertexes and reduce the size of data file
（ 2 ）提出了基於v - f （點-面）存儲結構的avl頂點聚合演算法和基於虛avl的鄰邊搜索優化演算法。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有相同角色，那麼與之相鄰接的點的角色集合也相同。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 ）倍使它成為周期圖。In this algorithm, the sharp features on a mesh model are located through analysis of quadric error matrixes of super - neighbor of vertices on the model, so that these features can be preserved during mesh simplification
通過分析網格模型中頂點超鄰域的二次誤差矩陣，對模型上的重要細節特徵進行定位，實現了網格簡化過程中細節特徵的保持。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個公共元。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語言數組方式簡明描述的數據結構實例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有相同角色，那麼分配到它們鄰接點的角色的集合也相同。( 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 ） ，其中從是圈或路The chapter 1 traces back to different emphasin on neighborhood circumstance construction in neighborhood theories and their practice in edges and suburbs. based on the situations of neighborhood construction in pingdingshan edge communities and the concept of neighborhood circumstance, chapter 2 establishes the evaluation system and the researching frame of neighborhood circumstance. chapter 3 analyzes the time - space distribution of social associations in different kinds of residents and obtains the objective needs of their social actions
全文共分五章，第一章追溯不同鄰里理論在鄰里環境營造方面的側重點作為研究的理論背景；第二章以平頂山市邊緣社區鄰里建設的現狀特點和問題為研究的現實背景，從明確鄰里的功能入手確立鄰里環境研究的評價體系和框架；第三章分析不同居民間社會互動在鄰里環境中的時空分佈結構，得出居民社會互動行為的客觀要求；第四章從問卷調查中研究不同居民在其他非物質內涵的形成過程中對鄰里環境的主觀期望；第五章針對調查結果提出物質規劃層面和社會發展層面的營造策略和措施。The label of a vertex in g ( w ) is the sum of the weight of its incident edges
在網路g （ w ）中，各頂點的標號為與該頂點相鄰各邊的權之和。The adjacent vertex - distinguishing total coloring of some classes of graphs
幾類圖的相鄰頂點可區別的全染色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
摘要首先基於相鄰像素間的歐氏距離計算出輪廓曲線上每一點的支持區域及支持半徑，用線性插值得到支持區域的端點；然後求得支持區域的質心，以曲線上的點和其相應的支持區域質心之間的距離作為特徵響應篩選出候選特徵點；最後將具有局部極大特徵強度的點作為多邊形的頂點。分享友人