Liang–Barsky algorithm: Difference between revisions

Revision as of 08:21, 22 August 2011

Revision as of 11:49, 22 August 2011

Line 1:

In [[computer graphics]], the '''Liang–Barsky algorithm''' algorithm(named after You-Dong Liang and [[Brian A. Barsky]]) is a [[line clipping]] algorithm. The Liang–Barsky algorithm uses the parametric equation of a line and inequalities describing the range of the clipping box to determine the intersections between the line and the clipping box. With these intersections it knows which portion of the line should be drawn. This algorithm is significantly more efficient than [[Cohen–Sutherland]].

The idea of the Liang-Barsky clipping algorithm is to do as much testing as possible before computing line intersections.

Line 32:

* [[Nicholl–Lee–Nicholl]]

* [[Fast-clipping]]

==References==

* Liang, Y.D., and Barsky, B., "A New Concept and Method for Line Clipping", ''ACM Transactions on Graphics'', 3(1):1-22, January 1984.

* Liang, Y.D., B.A., Barsky, and M. Slater, ''Some Improvements to a Parametric Line Clipping Algorithm'', CSD-92-688, Computer Science Division, University of California, Berkeley, 1992.

* James D. Foley. ''[http://books.google.com/books/about/Computer_graphics.html?id=-4ngT05gmAQC Computer graphics: principles and practice]''. Addison-Wesley Professional, 1996. p. 117.

==External links==

* http://hinjang.com/articles/04.html

[[Category:Clipping (computer graphics)]]