Rectangular Window: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 40: Line 40:
[[File:Line Clipping - Rectangular Window - Space.png|1000px]]
[[File:Line Clipping - Rectangular Window - Space.png|1000px]]


== Space-Time Tradeoff Improvements ==  
== Time-Space Tradeoff ==  


[[File:Line Clipping - Rectangular Window - Pareto Frontier.png|1000px]]
[[File:Line Clipping - Rectangular Window - Pareto Frontier.png|1000px]]

Revision as of 15:43, 15 February 2023

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 rectangular.

Related Problems

Generalizations: Convex Polygonal Window

Related: Convex Polyhedral Window

Parameters

n: number of lines

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Cohen–Sutherland 1967 $O(n)$ $O({1})$ auxiliary Exact Deterministic Time
Liang–Barsky 1984 $O(n)$ $O({1})$ auxiliary Exact Deterministic Time
Nicholl–Lee–Nicholl 1987 $O(n)$ $O({1})$ auxiliary Exact Deterministic Time
Fast clipping 1987 $O(n)$ $O({1})$ auxiliary Exact Deterministic Time

Time Complexity Graph

Line Clipping - Rectangular Window - Time.png

Space Complexity Graph

Line Clipping - Rectangular Window - Space.png

Time-Space Tradeoff

Line Clipping - Rectangular Window - Pareto Frontier.png

References/Citation

https://dl.acm.org/doi/10.1145/357332.357333