词条 | Cyrus–Beck algorithm |
释义 |
The Cyrus–Beck algorithm is a generalized line clipping algorithm. It was designed to be more efficient than the Cohen–Sutherland algorithm, which uses repetitive clipping.[1] Cyrus–Beck is a general algorithm and can be used with a convex polygon clipping window, unlike Sutherland–Cohen, which can be used only on a rectangular clipping area. Here the parametric equation of a line in the view plane is where . Now to find the intersection point with the clipping window, we calculate the value of the dot product. Let pE be a point on the clipping plane E. Calculate : if < 0, vector pointed towards interior; if = 0, vector pointed parallel to plane containing p; if > 0, vector pointed away from interior. Here n stands for normal of the current clipping plane (pointed away from interior). By this we select the point of intersection of line and clipping window where (dot product is 0) and hence clip the line. Notes1. ^"Clipping" (presentation). See alsoAlgorithms used for the same purpose:
References in other media:
References
External links
1 : Line clipping algorithms |
随便看 |
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。