line clipping algorithm 中文意思是什麼
line clipping algorithm
解釋
線剪取演算法-
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
一般多邊形窗口線裁剪的改進演算法充分利用確定被裁線段與多邊形邊無交的兩個判斷條件，對完全不可見線段以及與被裁線段無有效交點的多邊形邊進行了排除，只有當線段與多邊形邊有有效交點時才求交，避免了不必要的求交，提高了演算法效率。 -
A new 2 - d line clipping algorithm
二維線段裁剪新演算法 -
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
矩形窗口多邊形裁剪的改進演算法通過引入多交表、矩交表、入點表、出點表等線性鏈表，解決了如何確定一般多邊形在矩形窗口裁剪后封閉區域邊界問題，並把二次編碼技術由線裁剪拓展到多邊形裁剪中，對處于窗外的多邊形的邊可直接處理，提高了演算法的效率。 -
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
另外，作者在對已有的掃描線填充演算法深入研究的基礎上，介紹一種利用裁剪區域的邊的連貫性和掃描線的連貫性，從而減少求交計算量、提高演算法效率的有序鏈表的快速裁剪演算法。
分享友人