Line Clipping

From Algorithm Wiki
Revision as of 11:58, 10 October 2022 by Admin (talk | contribs) (Created page with "== Problem Description== Given a set of lines and a rectangular area of interest, the task is to remove lines which are outside the area of interest and clip the lines which are partially inside the area. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algor...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem Description

Given a set of lines and a rectangular area of interest, the task is to remove lines which are outside the area of interest and clip the lines which are partially inside the area.

Bounds Chart

Line ClippingBoundsChart.png

Step Chart

Line ClippingStepChart.png

Improvement Table

Complexity Classes Algorithm Paper Links Lower Bounds Paper Links
Exp/Factorial
Polynomial > 3
Cubic
Quadratic
nlogn
Linear Cohen–Sutherland (1967)

Liang–Barsky (1984)

Cyrus–Beck (1978)

Nicholl–Lee–Nicholl (1987)

Fast clipping (1987)

logn Skala (1996)