Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Liang–Barsky_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Liang–Barsky_algorithm abstract "In computer graphics, the Liang–Barsky 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 window to determine the intersections between the line and the clipping window. 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. Consider first the usual parametric form of a straight line:A point is in the clip window, ifand,which can be expressed as the 4 inequalities,where(left)(right)(bottom)(top)To compute the final line segment: A line parallel to a clipping window edge has for that boundary. If for that , , the line is completely outside and can be eliminated. When the line proceeds outside to inside the clip window and when , the line proceeds inside to outside. For nonzero , gives the intersection point. For each line, calculate and . For , look at boundaries for which (outside -> in). Take to be the largest among . For , look at boundaries for which (inside -> out). Take to be the minimum of . If , the line is outside and therefore rejected.".
- Liang–Barsky_algorithm wikiPageID "1943925".
- Liang–Barsky_algorithm wikiPageRevisionID "585824802".
- Liang–Barsky_algorithm subject Category:Clipping_(computer_graphics).
- Liang–Barsky_algorithm comment "In computer graphics, the Liang–Barsky 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 window to determine the intersections between the line and the clipping window. With these intersections it knows which portion of the line should be drawn.".
- Liang–Barsky_algorithm label "Algoritmo de Liang-Barsky".
- Liang–Barsky_algorithm label "Liang–Barsky algorithm".
- Liang–Barsky_algorithm sameAs Liang%E2%80%93Barsky_algorithm.
- Liang–Barsky_algorithm sameAs Algoritmo_de_Liang-Barsky.
- Liang–Barsky_algorithm sameAs Q606795.
- Liang–Barsky_algorithm sameAs Q606795.
- Liang–Barsky_algorithm wasDerivedFrom Liang–Barsky_algorithm?oldid=585824802.