頂點邊 的英文怎麼說
中文拼音 [dǐngdiǎnbiān]
頂點邊
英文
vertice edge- 頂 : i 名詞(人體或物體的最上部) crown; peak; top Ⅱ動詞1 (用頭支承) carry on the head 2 (從下面拱...
- 點 : Ⅰ名詞1 (液體的小滴) drop (of liquid) 2 (細小的痕跡) spot; dot; speck 3 (漢字的筆畫「、」)...
- 邊 : 邊Ⅰ名詞1 (幾何圖形上夾成角的直線或圍成多邊形的線段) side; section 2 (邊緣) edge; margin; oute...
- 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
-
We shall present some of the basic properties of the vertex and edge chromatic numbers.
我們將介紹頂點色數和邊色數的一些基本性質。Orientation and convexity - concavity identification for polygons using extremity vertices sequence
利用極點順序的多邊形頂點凹凸性判別演算法Some features of boundary vertices of coronoid systems
冠狀系統的邊界頂點的特徵If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph.
如果邊都是頂點的有序對,則得到有向圖和有向重圖的概念。Let xkv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by a edges ( z, y )
設k _ v是有v個頂點的完全多重圖,其中任意兩個相異頂點x和y都由條邊( x , y )相連。A complete multigraph of order v and index a, denotes by xk, is a graph with v vertices, where any two distinct vertices x and y are jointed by a edges ( x, y )
設k _ v是有v個頂點的完全多重圖,其中任意兩個相異頂點x和y都由條邊( x , y )相連。In the paper, the connectivity and diameters of sell - complementary 2 - multigraphs and sell - complementary digraphs are discussed, and if these graphs get disrupted the relations for the number ob edges and vertices between the two connected components are also studied in self - complementary permutation
摘要本文討論了2 -重自補圖和有向自補圖的連通性以及2 -重自補圖的直徑,同時以自補置換作為工具研究了當2 -重自補圖或有向自補圖被分成兩個連通分支后,這兩個連通分支之間的邊數與頂點數之間的關系。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代(或祖先) ,與該頂點相鄰的點稱為第一代。In this paper, the problem of calculating movement of piece is simplified to the problem of finding track line segments between vertices and edges, hence the time complexity is much reduced, and special cases such as inner cavity and inner nfp ( no fit polygon ) can also be tackled
摘要將多邊形滑動碰撞問題轉化為頂點和邊之間的軌跡線提取問題,從而降低了時間復雜度,並可統一處理邊界空腔和內部靠接臨界多邊形問題。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 )求解軌跡線集合所形成的外包多邊形和內部順時針環,得到的多邊形即為臨界多邊形。By the study of several typic methods of determining convexo - concave features for vertices of polygon, the computation time complexity of these methods was analysed, and those methods were implemented in vc + +
摘要主要針對幾種典型的多邊形頂點凸凹性識別演算法進行研究,對它們的計算時間復雜度進行分析,並用vc + + 6 . 0實現多邊形頂點凸凹性的高效識別。A star is defined as the set of edges incident to a vertex.
一個星形定義為關聯于某個頂點的邊的集合。The shear mechanism, failure mode, deformation capacity, bearing capacity and the reliability of the anchored angle steels of the wrapped steel concrete cast - in - site frame typical story exterior joints under the middle and high axial compression ratio ( n = 0. 3, 0. 5, 0. 6 ), the working performance, failure mode, and the shear capacity of top story joints under the crack moment, the hysteresis characteristic and the dissipation energy capacity of the test joints are all analysed based on the 1 / 4 model pseudo - static tests of five specimens of wrapped steel concrete cast - in - site frame exterior joints, which varied in axial compression ratio, distribution of the beam angle steels and the stirrup ratio
基於上述分析,本次試驗通過五個外包鋼混凝土邊節點1 4比例模型的偽靜力試驗,以柱的軸壓比、梁角鋼布置形式、配箍率等為主要參數,分析外包鋼混凝土現澆框架一般層邊節點在中高軸壓比( n = 0 . 3 、 0 . 5 、 0 . 6 )條件下,節點的抗剪機理、破壞模式、變形能力、承載能力和角鋼錨固的可靠性;分析了頂層邊節點在張開彎矩作用下的工作性能、破壞模式和抗剪承載力;分析了試驗節點的滯回性能和耗能能力。The virtual blending between surfaces is introduced, and offsetting surfaces of the edges and vertices of the machined solid model are generated to make the implementation of the algorithm more easily
在實體的棱邊和頂點處引入虛過渡,研究實現了棱邊和頂點等距面的生成。既保護了棱邊與頂點,避免了過切干涉,又簡化了編程。The research works finished in this paper are listed below : 1. solving the problem in testing of cylinder vessels that the sensors disposition is very rigorous, carrying out study of freewill triangle network orientation and linear orientation, bringing forward the discriminance which distinguish the validity of orientation array using character string method the first time, at the same time, solving the problems that judgement of orientation array, elimination of camouflage location, avoidance of repeat location, etc. 1 '. carry ing out the study of the orientation of defects in stand lank floor with the method of freewill planar triangle orientation, advancing bran - new discriminance on the validity of orientation arrays, orientation points, and the disposing means of the acoustic sources near sensors and those near common border
本文進行的主要研究工作有: 1解決柱式容器檢測中傳感器排布要求較嚴格的問題,開展任意三角形網路排布檢測技術與線定位技術研究,首次提出了利用字元串格式判斷線定位陣列有效性的判別方法,並解決了任意三角形定位中存在的定位陣列判斷,偽定位的剔除,重復定位的避免等一系列問題; 2利用平面任意三角形定位方法開展常壓立式儲罐罐底缺陷定位技術研究,提出了全新的定位陣列有效性判斷、定位點的有效性判斷方法;以及頂點聲源和邊界聲源的處理辦法。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
摘要根據醫學圖像分割的特點,建立了一種樣條幾何形變模型,它表示為一個有序的用邊線連接的頂點集合。Two dice, 6 faces each represent one number, when thrown twice, how many different value of the sum of the results ? 無 sum 為 1 的 可能
一個等邊三角形,邊長為2 ,在三角形內從三個頂點各有一個邊長為1的6分之一圓,三圓相切,問中間部分?If two edges of a graph are incident to the same pair of vertices, then these two edges are called parallel edges.
如果一個圖的兩條邊關聯于同一對頂點,則這兩條邊稱為平行邊。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的鄰邊搜索優化演算法。The approach to exactly calculate geometric parameters of subdivision surface, such as limiting point, tangent vector and normal vector, are illustrated. ( 2 ) the number of geometric elements ( vertex, edge, facet ) within control mesh grows exponentially as the increase of subdivision levels in general subdivision schemes
( 2 )在正常的曲面細分過程中,控制網格上幾何元素(頂點、邊、面)的數量是按照幾何級數增加的,會產生龐大的冗餘數據。分享友人