euclidean plane 中文意思是什麼

euclidean plane 解釋
歐幾里得平面
  • euclidean : adj. 【數學】歐幾里得的。
  • plane : n 懸鈴木屬樹木。n 1 平面，水平面，面。2 （知識等的）發達程度，水平，階段。3 【航空】機翼面；〈常 ...
  1. These are regular triangles in non - euclidean plane

    這些都是非歐平面上的正三角形，像不像扇子？
  2. Solving geometry constraints problems of point - plane configuration in euclidean space

    實空間中點面構型幾何約束問題求解新方法
  3. And then, in this part, following the idea of topping [ 51, 52 ], we will show an isoperimetric inequality ( 6. 3. 1 ) on surfaces of non - positive gaussian curvature by means of the curve shortening flow on surfaces, this inequality can be considered as a generalization of the banchoff - pohl inequality in the euclidean plane

    然後，仿照topping [ 51 ]和[ 52 ]利用平均曲率流證明等周不等式的想法，我們利用曲面上的曲線縮短流在gauss曲率非正的曲面上證明了一個等周不等式（ 6
  4. In the first part, depending on three or more images, the main research work are listed as follows : ( l ) using svd decomposition to realize projective reconstruction ; ( 2 ) realizing camera self - calibration by solving kruppa ' s equation ; ( s ) recovering euclidean reconstruction from projective reconstruction. depending on only two images, the main researches are : ( l ) making out infinite plane homography matrix by using scene structure information, then recovering affine reconstruction from projective reconstruction ; ( 2 ) making out the absolute conic images by using scene structure information, and then recovering euclidean reconstruction from projective reconstruction

    在第一部分中，針對三幅及三幅以上的圖像，主要研究：利用矩陣奇異值分解（ svd ）實現射影重構，通過求解kruppa方程實現攝像機自標定，由射影重構恢復歐氏重構；針對只有兩幅圖像的情況，主要研究：利用場景結構信息求解無窮遠平面的單應矩陣，由射影重構恢復仿射重構，利用場景結構信息求解絕對二次曲線的像（等價于標定攝像機） ，由仿射重構恢復歐氏重構。
  5. We systemically discuss how to uniquely decide an infinite plane homography matrix by using the structure information in scene and how to evaluate a homography matrix which convert affine reconstruction to euclidean reconstruction by solving absolute conic images. we give three constraints of absolute conic images and use these constraints to evaluate absolute conic images and then to rec

    系統地討論了如何利用場景中的結構信息，來唯一地確定無窮遠平面的單應矩陣，進而由射影重構恢復仿射重構，以及如何通過絕對二次曲線的像求解將仿射重構變換為歐氏重構的單應矩陣。
  6. The euclidean 2 - connected steiner network problem is to determine the minimum - weight 2 - connected steiner network on a given set of points in the euclidean plane

    設p是歐幾里德平面上的一個有限點集， n是頂點集為v ，邊集為e的一個網路，如果p
  7. Finding economical packing of circles in the euclidean plane is a widely investigated area of the theory of packing and covering. the simplest problem of this kind is to find the best arrangement of congruent discs in the plane

    關于圓盤的填充問題的一個重要猜想是：在全等圓盤的填充中，密度最大填充可由正六邊形阿基米德鑲嵌中的內圓得到，這一猜想直到本世紀初才得以證明。
分享友人
分享到 Line

分享到臉書