邊數 的英文怎麼說

中文拼音 [biānshǔ]
邊數 英文
number of sides
  • 邊 : 邊Ⅰ名詞1 （幾何圖形上夾成角的直線或圍成多邊形的線段） side; section 2 （邊緣） edge; margin; oute...
  • 數 : 數副詞（屢次） frequently; repeatedly
  1. Counts from the left hand the second keystroke

    從左手邊數起第二個按鍵
  2. 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 -重自補圖或有向自補圖被分成兩個連通分支后，這兩個連通分支之間的邊數與頂點數之間的關系。
  3. Some typical schemes are implemented via this data structure ( loop subdivision, catmull - clark subdivision, do - sabin subdivision, hybrid subdivision, adaptive subdivision ). the technique of opengl is utilized to accomplish some basic operations, such as rotation, zoom, pan, pick and so on. finally the algorithms studied by our research group are integrated, and a prototype system based on subdivision surface is developed

    （ 4 ）改進了適合於曲面細分的的翼邊數據結構，並實現了典型的細分演算法（ loop細分、 catmullclark細分、 doo - sabin細分、混合細分、自適應細分） ；採用opengl技術實現了旋轉、縮放、平移、拾取等圖形的基本幾何操作；最後將本課題組研究成果加以集成，開發了一個基於細分曲面的原型系統。
  4. On superior number of imbalanced edeges

    關于非平衡邊數目的上界
  5. This paper provides the functional equation and parametric expression of rooted near triangulations on the torus with the size and the valency of the root - face as two parameters, and gives an explicit formula for the number of rooted near triangulations of the root face valency one on the torus with the size as a parameter

    本文提供了環面上帶邊數和根面次這兩個參數的有根近三角剖分的函數方程及其參數表達式，並給出了根面次為1以邊數為參數的有根近三角剖分地圖的精確解
  6. This paper provides the functional equation of general rooted maps with the number of inner faces, the rooted face valency and the number of non - rooted vertices as parameters on the torus, and gives an explicit expression of the enumerating function of these maps with the number of inner faces and of non - rooted vertices, then the number of these maps with the size as a parameter whose asymptotic result had been obtained in [ 2 ] is obtained as a corollary

    這篇文章給出了環面上以內面個數，根面次和非根節點個數為參數的一般有根地圖的計數方程，導出了以內面個數和非根節點個數為參數的這類地圖的計數方程的精確解.作為推論，推出了以邊數為參數的這類地圖的個數，其近似解在文獻[ 2 ]中已討論
  7. The material is shear - ed, folded and punched by digital control machine tools and its surface is disposed with acid cleaning, parkerising and plastic spraying. the above mentioned craft is adopted firstly in capacitor industry

    櫃體採用優質冷軋鋼板經過數控剪切機剪切，數控折彎機折邊，數控機床沖制等工藝，表面經過酸洗磷化和高壓靜電噴塑工藝，屬電容器行業首創。
  8. Abstract : this paper provides the functional equation of general rooted maps with the number of inner faces, the rooted face valency and the number of non - rooted vertices as parameters on the torus, and gives an explicit expression of the enumerating function of these maps with the number of inner faces and of non - rooted vertices, then the number of these maps with the size as a parameter whose asymptotic result had been obtained in [ 2 ] is obtained as a corollary

    文摘:這篇文章給出了環面上以內面個數，根面次和非根節點個數為參數的一般有根地圖的計數方程，導出了以內面個數和非根節點個數為參數的這類地圖的計數方程的精確解.作為推論，推出了以邊數為參數的這類地圖的個數，其近似解在文獻[ 2 ]中已討論
  9. The supereulerian graph problem is an important study in the circle of graph theory, which mainly includes two aspects : one is the determination of supereulerian graphs and the other is the edge - problem

    超歐拉圖問題是圖論研究中非常重要的一個問題，這一問題主要有兩方面：一判定問題，二邊數問題。
  10. The sum of all the degree is 24, an even number, which is twice the number of edges.

    所有次數的和是24，是個偶數，它是邊數的兩倍。
  11. Abstract : in this paper the author got the enumeration equation of ed ge - non - separable with face partition, and also abtained its enumeration equation and expression with rooted face degree, edges and faces

    文摘:得到了邊不可分離有根平面地圖依面剖分的計數方程，並得到其依根面度數、邊數和面數三參數的計數方程及有關計數顯式
  12. But the difficulty with these two parameters is that they do not take into account what remains after the graph is disconnected. in fact, on one hand, it is often found that two graphs with the same number of vertices ( edges ) and the same connectivity ( edge - connectivity ) ) may result in entirely different forms after a minimum disconnecting set of vertices ( edges ) is removed, one may be totally disconnected while the other may consist of a few very stable components, and thus be much easier to reconstruct

    對于兩個具有相同點（邊）數，具有相同點連通度（邊連通度）的圖，從圖中分別去掉使圖不連通的點（邊）集后，所得圖的結構可能完全不同，這是因為點連通度、邊連通度和局部點、邊連通度等連通性參數僅反映了系統被破壞的難易程度，而對系統遭受破壞的程度並沒有明確的反映。
  13. Therewith he lined up the last two and proceeded to the head, counting as he went

    說罷，他讓最後兩個人站到隊伍里，然後自己朝隊首走去，邊走邊數著人數。
  14. Category - i maximal graphs with given number of path - hamilton edges

    邊數的一類極圖
  15. Topographical maps are the principal frame form of gis, and realization map digitizing and offering gis basic spatial data is one of the important research fields in surveying and gis, which is also necessity of development of science and technology. based on building gis - oriented topographical mapping system theories, this themes apply the advanced objectarx technology, aim at topographical mapping and exporting to gis, and resolve several key problems, such as symbols analysis and building, dtm and contour line automatic drawing, topographical map adjoining, digital image rectifying etc. and it offers models and arithmetic, realizing the general functions of gis - oriented topographical mapping system

    本文以建設面向gis的測量繪圖平臺理論為基礎，以autocad平臺下objectarx開發技術為核心，圍繞地形圖的成圖和入庫（ gis數據庫）這一課題，對其中的關鍵技術難題? ?符號庫的建立與實現、 dtm與等高線的自動繪制、地形圖接邊、數字化柵格圖像的定向與糾正、介面數據文件的生成等進行了研究分析，提出了相應的模型和演算法，實現了面向gis的測量繪圖系統的基本功能。
  16. ( 2 ) based on the object prototype represented by half - edge data structure, the paper presents a method to construct fragments in explosion, which is called random - classification construction method

    （ 2 ）針對半邊數據結構表示的物體原模型，提出了物體爆炸時構造破片的理論方法，稱之為隨機分類構造法。
  17. If you click inside the polygon, the number of sides increases

    如果單擊多邊形的內部，則邊數增加。
  18. If you click outside the polygon, the number of sides decreases

    如果單擊多邊形的外部，則邊數減少。
  19. A note on maximum number of edges in a spanning eulerian subgraph

    生成子圖極大邊數的一個注記
  20. A method to probe into the number of edges of spanning eulerian subgraph

    生成子圖邊數的一種方法
分享友人
分享到 Line

分享到臉書