# Clipping: Liang-Barsky Line Clipping

### Overview of Steps

- Express line segments in parametric form
- Derive equations for testing if a point is inside the
window
- Compute new parameter values for visible portion of line
segment, if any
- Display visible portion of line segment

The relative speed improvement over Sutherland-Cohen algorithm
is as follows:

36% for 2D lines

40% for 3D lines

70% for 4D lines

Clipping Techniques: 2D

HyperGraph
Table of Contents.

HyperGraph Home
page.

Last changed May 13, 1998, G. Scott Owen, owen@siggraph.org