Convex Polygonal Window (Line Clipping)

From Algorithm Wiki
Revision as of 14:43, 15 February 2023 by Admin (talk | contribs)
Jump to navigation Jump to search

Description

Line clipping is the process of removing lines or portions of lines outside an area of interest. Typically; any line or part thereof which is outside of the viewing area is removed. Here, the viewing area is a convex polygon.

Related Problems

Generalizations: Convex Polyhedral Window

Subproblem: Rectangular Window

Parameters

n: number of lines

p: number of edges on polygon

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Cyrus–Beck 1978 $O(np)$ $O({1})$ auxiliary? Exact Deterministic Time

Time Complexity Graph

Line Clipping - Convex Polygonal Window - Time.png

Space Complexity Graph

Line Clipping - Convex Polygonal Window - Space.png

Time-Space Tradeoff

Line Clipping - Convex Polygonal Window - Pareto Frontier.png

References/Citation

https://www.sciencedirect.com/science/article/pii/0097849394900647/pdf?md5=06bd1f11031af17d1fd34626c4e2f49b&pid=1-s2.0-0097849394900647-main.pdf