line polygon 中文意思是什麼
line polygon
解釋
索多邊形-
The new line against polygon window clipping algorithm which makes full use of two judgement conditions to confirm noneffective intersections between the lines and the polygon edges can only calculate the effective intersections and increases the efficiency of the clipping. third, a new 3 - d clipping algorithm of line against spherical surface window is introduced for the first time
一般多邊形窗口線裁剪的改進演算法充分利用確定被裁線段與多邊形邊無交的兩個判斷條件，對完全不可見線段以及與被裁線段無有效交點的多邊形邊進行了排除，只有當線段與多邊形邊有有效交點時才求交，避免了不必要的求交，提高了演算法效率。 -
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 ）求解軌跡線集合所形成的外包多邊形和內部順時針環，得到的多邊形即為臨界多邊形。 -
Second, after limitations of present algorithms are analyzed, two improved clipping algorithms of polygon against rectangle window and line against polygon window are presented
其次在分析現有演算法不足的基礎上提出了矩形窗口多邊形裁剪和一般多邊形窗口線裁剪的改進演算法。 -
Grid hiding and break line cut are difficult point in displaying of 3 - d grid data, the thesis also presented a new visualizing algorithm applicable for 3 - d grid data of topography - sliced polygon filling. the experiment result shown, contrasting to floating level, this algorithm excels in both time complication and effect of grid hiding and break line cut
三維網格顯示中的網格消隱與斷線處理一直是網格可視化技術中的難點，本文結合三維地形網格的特點，提出了一種新的網格可視化演算法? ?切片多邊形區域填充法，在實驗結果對比中，無論是演算法復雜度還是顯示效果上都明顯優于浮動水平面法。 -
An algorithm for connecting non - intersecting line segments into a simple polygon
一種用射影線束族生成曲線的方法 -
By constructing the list of vertices of polygon and intersecting points between polygon and rectangle, the list of vertices of rectangle and between polygon and rectangle, the list of incoming points and the list of outcoming points, the problem that how to confirm close clipped area edge is solved. at the same time, the second encoding technology is developed from line clipping to polygon clipping so that the speed of algorithm is increased
矩形窗口多邊形裁剪的改進演算法通過引入多交表、矩交表、入點表、出點表等線性鏈表，解決了如何確定一般多邊形在矩形窗口裁剪后封閉區域邊界問題，並把二次編碼技術由線裁剪拓展到多邊形裁剪中，對處于窗外的多邊形的邊可直接處理，提高了演算法的效率。 -
R - tree primarily indexes on point and polygon objects. bucketfile only indexes on line objects
基於r樹的空間索引結構主要對點對象和面對象進行索引； bucketfile空間索引結構主要對線對象進行索引。 -
Moreover, based on in - depth research of " the existing scan - line polygon fill algorithm, the author has introduced a new fast method for clipping arbitrary boundary areas algorithm which uses the edge consistency and the scan - line consistency and adopts sorted chain table, i t can reduce the quantity of calculating intersection points and improve the efficiency of algorithm
另外，作者在對已有的掃描線填充演算法深入研究的基礎上，介紹一種利用裁剪區域的邊的連貫性和掃描線的連貫性，從而減少求交計算量、提高演算法效率的有序鏈表的快速裁剪演算法。 -
In computer graphics, the simple function for drawing on the screen. typical primitives are rectangle, line, polygon, etc
在計算機圖形學中，在熒光屏上繪圖的簡單程序。典型的圖元是長方塊、線段、多邊形等。 -
The paper mainly expounds the principle of automatic name placement of area element by center array method, the algorithm of polygon pretreatment, the method of getting array rotating center and the algorithm of name placement positioning line
摘要本文闡述了中心陣列法進行面狀要素自動注記的原理、多邊形預處理演算法、求取陣列旋轉中心的方法和求取注記定位線的演算法。 -
And its spatial analytic functions such as overlay analysis and buffer analysis that can be used to extract multiple variables and information from geologic bodies organized in map layers in point, line or polygon shape are in favor of discovering ore - forming factors, summarizing regional metallogenic regularities and constructing geologic metallogenic models
以矢量數據結構為主，實現了對點、線、面地質體的gis空間分析功能，以便對多元矢量數據信息進行疊加分析和相關分析，發現和歸納研究區域的成礦規律，建立成礦地質模型。 -
The basic type of spatial object includes point, polygon and line
基本空間對象類型包括點對象、面對象、線對象。 -
This paper also analyzed some key problems in 3d triangulation from scattered points. new determining principles for the relationship of point and line in space and for convexo - concave vertices of space polygon is discussed which corrected the previous method and can be applied in space triangle mesh. at the end of this papar, the future research areaes of triangluation from 3d scattered points are demonstrated
本文還分析了三維空間直接三角剖分所要解決的一些關鍵問題，進而提出了空間中點與直線位置關系判別的新方法及空間多邊形頂點凹凸性判別的新方法，修正了以往演算法在應用上的局限性，使之能夠適用於復雜網格多邊形邊界。 -
At one time the second encoding technology is developed from retangle window to circle window, from line clipping to polygon clipping and from 2 - d clipping to 3 - d clipping
把二次編碼技術由矩形窗口深入拓展到圓形窗口，由線裁剪拓展到多邊形裁剪，以及從二維窗口深入到三維窗口。 -
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 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。 -
Polygon clipping is more often used than line clipping in practice, so it is the main subject in clipping research now
多邊形裁剪與線剪裁相比具有更廣泛的實用意義，因此它是目前裁剪研究的主要課題。 -
During practical research, comparing with line clipping, polygon clipping has high rate of utilization, so it is the main subjects of clipping studied at present
在實際運用中，多邊形裁剪與線裁剪相比具有更高的使用率，因此它是目前裁剪研究的主要課題。 -
Based on the object - oriented technique, this study defines four types of geographical event, i. e. expansivity, contraction, rebirth and vanishment events for management of land use data. and it further designed an object - superposition data updating model based on the land use feature of point, line and polygon ， which would take the advantage of the gis overlay function to effectly implement of updating spatial and attribute data
從面向對象的方法入手，定義了引起土地利用變化的擴展、收縮、新生與消亡四種地理事件，並分別按點狀地物、線狀地物和面狀圖斑的土地利用實體特徵設計了對象疊加更新模型，從而能利用gis強大的空間分析能力，來有效地實現空間數據和屬性數據的一致性更新。 -
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時空數據建模中的思想。
分享友人