convex plane 中文意思是什麼

convex plane 解釋
平凸形
  • convex : adj. 中凸的,凸圓的,凸面的。n. 凸狀,凸面,凸圓體。 convex glasses 遠視眼鏡,老花眼鏡。adv. -ly
  • plane : n 懸鈴木屬樹木。n 1 平面,水平面,面。2 (知識等的)發達程度,水平,階段。3 【航空】機翼面;〈常 ...
  1. This setup, known as a conoscope, is shown in figure 14. 2 and consists of two stress - free plane - convex lenses a and b and a diaphragm c having a small aperture

    此裝置稱為錐光鏡,如圖14 2所示,它由a和b兩個無應力平凸透鏡和一個帶小孔的光闌c組成。
  2. Thirdly, from the idea of locally linear approximate, another tangent - plane algorithm is presented for the distance between the convex nurbs surfaces. the critical step is the construction of the support mapping by gjk and lc to search for nearest points, and emphases are laid on dealing with isotropic cases and choosing initial iterated points. it is also proved that no isotropism during iteration would take place if initial iterated points are positive points

    切平面法是運用gjk和lc構造支撐映射的原理而設計的一個搜索近點對的迭代法,著重給出了迷向情況的處理和初始迭代點的選取方法,並證明了只要將初始迭代點取為陽點,就不會出現迷向情況。
  3. This setup, known as a conoscope, is shown in figure 14. 2 and consists of two stress-free plane-convex lenses a and b and a diaphragm c having a small aperture.

    此裝置稱為錐光鏡,如圖142所示,它由A和B兩個無應力平凸透鏡和一個帶小孔的光闌C組成。
  4. The algorithm for convex hull set of plane finite point set

    平面有限點集最小凸包集的計算方法
  5. The border panoramas are created by constraining viewpoint motion to arbitrary convex region of a plane, and sampling cylindrical panoramas at border of the region point by point

    邊界全景圖通過限定視點在平面上任意的凸區域內運動,並且在區域的邊界上逐點采樣柱面全景圖而構成。
  6. In addition, by phase plane method we obtain the existence of travelling fronts ( al ) connecting two adjacent equilibria under the assumptions that f " is bounded and that of viscous shock waves c connecting two adjacent saddle points with / a convex function

    另外,利用經典的相平面分析法,本文證明了( )在f有界時存在連接相鄰平衡點的波前( a1 )及在f為凸時存在連接相鄰鞍點的粘性沖擊波c 。
  7. This paper consists of three parts as follows, 1. a nonsmooth convex programming is relaxed to a smooth convex programming by using a cutting - plane, which is constructed by subgradient. an algorithm based on the cutting - plane is presented. in this way, a cutting plane algorithm and it ' s convergence for semide ? nite programming are provided

    利用次微分的概念給出了一種非光滑凸規劃割平面的構造技巧,找到了半定規劃可行域的一個支撐超平面,從而給出了求解半定規劃的一種割平面演算法
  8. Secondly, in this part, we will introduce the notation of average geodesic curvature for curves in the hyperbolic plane, and investigate the relationship between the embeddedness of the curve and its average geodesic curvature. finally, we will employ the minkowski ' s support function to construct a new kind of non - circular smooth constant breadth curves in order to attack some open problems on the constant width curves ( for example, whether there is a non - circular polynomial curve of constant width, etc. ) in the second part, we will first follow the ideas of gage - hamilton [ 28 ], gage [ 26 ] and the author ' s dissertation [ 47 ] to present a perimeter - preserving closed convex curve flow in the plane, which is from physical phenomena

    其次,對雙曲平面上的曲線引入平均測地曲率的概念,並討論雙曲平面上凸曲線的嵌入性與它的平均測地曲率之間的關系,其目的是為了將雙曲平面上曲線的性質與歐氏平面中曲線的性質作一些對比;最後,我們利用minkowski支撐函數構造了一類新的非圓的光滑常寬曲線,其目的是想回答有關常寬曲線的一些未解決問題(如是否存在非圓的多項式常寬曲線
  9. Four - sided faces only work well if the face is pretty much flat ( all points lie within one imaginary plane ) and convex ( the angle at no corner is greater than or equal to 180 degrees )

    四邊面只有在面是非常平整並且是直角的時候工作才是最好的(也就是四點處同一平面上) 。
  10. Janos pach and rom pinchasi ( see [ 61 ] ) proved that any set of n points in strictly convex position in the plane has at most [ 2 ( n - 1 ) / 3j triples that induce unit triangles ( equilateral triangles of side length one ), and any set of n points in convex position in the plane has at most n - 2 triples that induce unit triangles

    平面中任一處于凸位abstract置的二一點集至多有2 。一4個三元組滿足:每一三元組均導出一個與t0全等的三角形.定理2 . 2 .給定一等腰直角三角形t0 ,平面中任一處于強凸位置的n一點集至多有二個三元組滿足:每一三元組均導出一個與幾全等的三煮形
  11. The experiment with cr4 + : yag of 30 % and 63 % initial transparence was conducted in plane - convex unstable resonators and get the laser ' s fwhm and output energy are accordingly 8ns and 52mj, 18ns and 45. 7mj. it is proved that the nearer the max initial transparence is the initial transparence, the stronger intensity and smaller fwhm can be obtained cr4 + : yag crystal, which is consistent with the theoretical results. in addition, the experimental results acquired in different resonator structures and parameters are also analyzed

    在平-凸非穩腔中,採用初始透過率為30和63的cr ~ ( 4 + ) yag進行實驗,得到能量和脈寬相應為52mj 、 8ns和45 . 7mj 、 18ns的調q脈沖輸出,這表明:採用初始透過率越靠近最大初始透過率的cr ~ ( 4 + ) yag ,可得到越理想的實驗結果,這與理論分析一致。
  12. A geometric transversal is defined to be an affine subspace ( such as a point, a line, a plane, or a hyperplane ) intersecting every member of a given family. in part i we discuss three kinds of such problems. in chapter 2 we discuss point transversal to a family of translates of a convex sets in the plane, where we prove a famous conjecture of griinbaum ' s by a concrete and straightforward method for some special cases

    如果一仿射子空間(如一個點,一條直線,一個平面,或一個超平面)與一給定集族的每一個元都相交,則我們稱該仿射子空間為該給定集族的一個幾何橫截(點橫截,直線橫截,平面橫截等) ,也稱該仿射子空間橫截該給定集族。
  13. In section one, based on theory of n dimensional euclid space, a new method labeled as " pointlineplane " recycling optimization algorithm is proposed to solve the linear programming problem. this algorithm is proposed on the basis of the thought as follovvs : as for three dimensional euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter

    第一部分內容是在n維歐氏空間理論的基礎上提出了一種求解線性規劃問題的新演算法? 「點線面」循環尋優法,本演算法是基於如下思想提出來的:我們知道,在三維歐氏空間中,線性規劃問題的可行域是一個由若干個平面圍成的廣義多面體,目標函數可以看作是以目標函數值為參變量的一個平行平面束。
  14. Here, we will give an independent proof of the existence for inequality ( 2. 1. 3 ), and by the way, give an estimate on the width of the bi - enclosing annulus of closed convex curves in the plane

    3 )給出獨立的存在性證明,並且還對平面閉凸曲線的bi - enclosing環的寬度給出了一個估計。
  15. In the first part, we will first deal with the strong bonnesen - style inequality ( 2. 1. 3 ) for closed convex curves in the plane ( the numbers of formulae and references are those of them in the context below )

    3 ) (公式的編號和參考文獻的編號引自後面的正文) , bonnesen在文[ 12 ]中先證明了較弱的不等式( 2
  16. This report is composed of two main parts, one concerns some geometric inequalities about curves and an application of the minkowski ' s support function, the other deals with the perimeter - preserving flow of closed convex curves in the plane and an application of the curve shortening flow on surfaces

    本文主要由兩個部分組成,第一部分涉及曲線的一些不等式以及minkowski支撐函數的一個應用;第二部分討論歐氏平面上閉凸曲線的保長度流和曲面上曲線縮短流的一個應用。
  17. 3. when = 0, we give the curve of the multiple orbit bifurcation in the parameter plane (, l ). and we prove that the bifurcation of multiple loop is a double orbit bifurcation and the curve is convex

    3 、當= 0時,在參數平面上( , l )給出重閉軌分支曲線並證明該重閉軌分支為二重閉軌分支,且該分支曲線是上凸的。
分享友人