simple polygon 中文意思是什麼
simple polygon
解釋
簡單多邊形-
The main innovation of our method is that we only need construct polygonal mesh possessing simple symmetric properties on both sides of control polygon edges of interpolated curves, and do n ' t need modify the subdivision rules near the interpolation curves during the process of subdivision. thus the subdivision rules are simple. the process is convergent and the limit surface is c everywhere except a finite number of points
該方法的主要創新思想是，在被插值曲線的控制多邊形兩側構造具有簡單對稱性質的多邊形網格，而在細分過程中，則無須修改被插值曲線附近的細分規則，兇此細分演算法是簡單的，細分過程是收斂的，且最終的插值曲面除有限個點外是c ~ 2連續的。 -
An algorithm for connecting non - intersecting line segments into a simple polygon
一種用射影線束族生成曲線的方法 -
Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry
摘要簡單多邊形凸單元剖分是計算幾何的基本問題之一，剖分演算法在許多領域均有較廣泛的應用。 -
Cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly. new algorithms for orientation and inclusion test for simple polygon are proposed. and ghosh ' s convex hull algorithms for simple polygon and convex polygons, subramanian ' s triangulation algorithm for arbitrary planar domain and o ' rourke ' s intersection algorithm for convex polygons are modified to make them more robust
斷層輪廓為簡單多邊形，首先對多邊形的一些相關演算法進行了研究，提出了一種判斷簡單多邊形方向及點在多邊形內外的新方法，改進了subramanian的平面多連通域的三角劃分方法、 ghosh的多邊形的凸包及多個多邊形的凸包演算法和o ' rourke的凸多邊形的求交演算法。 -
A fast point visibility algorithm for simple polygon
簡單多邊形可見點問題的快速求解演算法 -
Algorithm on the convex hull of a simple polygon
簡單多邊形凸包的演算法 -
An old theorem from the first half of the nineteenth century by lowry, wallace, bolyai and gerwien asserts that any simple polygon can be dissected into a finite number of pieces and put back together to form any other simple polygon of the same area
十九世紀上半葉lowry ， wallace ， bolyai與gerwien同時證明了一個古老的數學命題：任意給定平面上一個簡單多邊形，必可將其分劃成有限塊，重新安排，拼成另一個任意給定的等面積的簡單多邊形。 -
To fulfill the need of the application of rp technique in medical domain, reverse cad modeling from medical cross sections is systematically studied in this dissertation. firstly, some algorithms related to the research of this dissertation are studied. new algorithms for orientation and inclusion test for simple polygon, an error constrained automatic faring algorithm for b - spline curve and a theorem regarding the termination criterion for subdivision of triangular bezier patch are proposed
本文針對rp技術在醫學領域應用的需要，系統研究了基於醫學斷層輪廓數據的反求cad建模理論和方法： （ 1 ）在基礎演算法研究部分，提出了簡單多邊形方向及點在多邊形內外判斷的新方法、三角b zier曲面片離散的誤差控制定理和一種帶誤差約束的b樣條曲線的自動光順方法； （ 2 ）提出了一種基於相鄰層輪廓相似性的醫學斷層輪廓數據曲面重構方法； （ 3 ）提出了一種稱為「虛擬測量」的曲面模型處理方法。 -
In computer graphics, the simple function for drawing on the screen. typical primitives are rectangle, line, polygon, etc
在計算機圖形學中，在熒光屏上繪圖的簡單程序。典型的圖元是長方塊、線段、多邊形等。 -
According to the characters of three - dimension engineering, it designs data structure and data model by the method of oop. data structure of oop is applied to the modelling based on graphics. it realizes the display of three - dimension graphics in engineering. the system can import / export 3ds files. it realizes selection, feedback of 3d shape and the management of 3d shape ' s properties ; 3d shape frome 2d contour lines and the medial axis of a convex polygon and an arbitrary simple polygon are discussed
針對三維工程的特點，採用面向對象的思想進行數據結構與數據模型的設計；將面向對象數據結構應用於基於圖形的建模技術中，實現了工程中三維圖形的顯示，並通過與3ds文件的介面，導入造型復雜的模型進行補充；基於二維設備的三維交互問題，實現了對三維形體的選擇、反饋以及三維形體的屬性數據的管理；對由二維輪廓線構造三維形體，本文創造性的提出了利用多邊形的中軸來構造三維形體，並修正了求多邊形中軸的演算法。 -
In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object
同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。 -
A simple example is given to support the theory. object - oriented technique is widely used in gis data modeling. point - object class, line - object class, time class, polygon - object class and complex - object class are extracted from geo - objects, which combines with spatio - temporal topology forms an object - oriented gis spatio - temporal data model
運用面向對象的分析技術，對gis中點、線、面基本對象類和復雜對象類的分析與描述，結合時空拓撲的描述，總結出了一個面向對象的gis時空數據模型，體現了面向對象理論在gis時空數據建模中的思想。 -
In order to prove i am alive, i write a simple algorithm to generate simple polygon from a set of points because i only think when i do coding
身為科技外語系主任的劉教授終于想出一個他知道合適的英文單詞，同時借機一仰脖又喝一杯。
分享友人