In computer graphics, the Liang-Barsky algorithm, named after You-Dong Liang and Brian A. Barsky, is a line clipping algorithm first published in early 1984. It uses the parametric equation of a line together with inequalities describing the range of the clipping window to determine the intersections between the line and the clip window, so it knows which portion of the line should be drawn, making it significantly more efficient than the Cohen-Sutherland algorithm. The idea of the Liang-Barsky clipping algorithm is to do as much testing as possible before computing the actual line intersections.
Facts
Time Complexity
Time Complexity (category) Connections
In Field
Source Liang-Barsky algorithm (Wikipedia)
Sources
1. Liang-Barsky Algorithm (Wikipedia)
Wikipedia infobox: time complexity constantQuote, Wikipedia infobox: time complexity constant
constant
Liang-Barsky Algorithm (Wikipedia) TEST
Wikipedia infobox: time complexity constant TESTQuote, Wikipedia infobox: time complexity constant TEST
constant
Liang-Barsky algorithm (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead sentence
Liang-Barsky algorithm (named after You-Dong Liang and Brian A. Barsky) is a line clipping algorithm first published in early 1984. The Liang-Barsky algorithm uses the parametric equation of a line and inequalities describing the range of the clipping window t
In Group: Line Drawing and Clipping Algorithms, Lead section
is a line clipping algorithm
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.