Cyrus–Beck algorithm
In computer graphics, the Cyrus–Beck algorithm is a generalized algorithm for line clipping. It was designed to be more efficient than the Cohen–Sutherland algorithm, which uses repetitive clipping. Cyrus–Beck is a general algorithm and can be used with a convex polygon clipping window, unlike Cohen-Sutherland, 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 be a point on the clipping plane . Calculate :
- Comment
- enIn computer graphics, the Cyrus–Beck algorithm is a generalized algorithm for line clipping. It was designed to be more efficient than the Cohen–Sutherland algorithm, which uses repetitive clipping. Cyrus–Beck is a general algorithm and can be used with a convex polygon clipping window, unlike Cohen-Sutherland, 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 be a point on the clipping plane . Calculate :
- Depiction
- Has abstract
- enIn computer graphics, the Cyrus–Beck algorithm is a generalized algorithm for line clipping. It was designed to be more efficient than the Cohen–Sutherland algorithm, which uses repetitive clipping. Cyrus–Beck is a general algorithm and can be used with a convex polygon clipping window, unlike Cohen-Sutherland, 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 be a point on the clipping plane . Calculate : * if < 0, vector pointed towards interior; * if = 0, vector pointed parallel to plane containing ; * if > 0, vector pointed away from interior. Here 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.
- Is primary topic of
- Cyrus–Beck algorithm
- Label
- enCyrus–Beck algorithm
- Link from a Wikipage to an external page
- www.sciencedirect.com/science/article/pii/0097849378900213
- web.archive.org/web/20110725233122/http:/softsurfer.com/Archive/algorithm_0111/algorithm_0111.htm
- books.google.com/books%3Fid=-4ngT05gmAQC
- web.archive.org/web/20101203041134/http:/cs1.bradley.edu/public/jcm/cs535CyrusBeck.html
- Link from a Wikipage to another Wikipage
- Algorithm
- Category:Line clipping algorithms
- Cohen–Sutherland algorithm
- Computer graphics
- Convex polygon
- Dot product
- Fast clipping
- File:Cyrus-beck.svg
- Liang–Barsky algorithm
- Line clipping
- Nicholl–Lee–Nicholl algorithm
- Normal (geometry)
- Parametric equation
- Tron: Uprising
- SameAs
- 4j1im
- Algoritmo de Cyrus-Beck
- m.0fq1psj
- Q5201169
- Алгоритм Кируса — Бека
- Алгоритм Кіруса — Бека
- Сајрус-Беков алгоритам
- Subject
- Category:Line clipping algorithms
- Thumbnail
- WasDerivedFrom
- Cyrus–Beck algorithm?oldid=1100467542&ns=0
- WikiPageLength
- 2425
- Wikipage page ID
- 29724524
- Wikipage revision ID
- 1100467542
- WikiPageUsesTemplate
- Template:Compu-graphics-stub
- Template:Reflist
- Template:Short description
- Template:Tmath
