Liang–Barsky algorithm
id:
liang-barsky-algorithm-195-1059545
title:
Liang–Barsky algorithm
text:
In computer graphics, the Liang–Barsky algorithm 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 clip window. With these intersections it knows which portion of the line should be drawn. So this algorithm is significantly more efficient than Cohen–Sutherland. The idea of the Liang–Barsky clipping algorithm is to do as much testing as
brand slug:
wiki
category slug:
encyclopedia
description:
Line-clipping algorithm
original url:
https://en.wikipedia.org/wiki/Liang%E2%80%93Barsky_algorithm
date created:
date modified:
2023-05-01T01:57:46Z
main entity:
{"identifier":"Q606795","url":"https://www.wikidata.org/entity/Q606795"}
image:
fields total:
13
integrity:
14