Convex Polygonal Window: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(4 intermediate revisions by the same user not shown)
Line 12: Line 12:
== Parameters ==  
== Parameters ==  


n: number of lines
$n$: number of lines


p: number of edges on polygon
$p$: number of edges on polygon


== Table of Algorithms ==  
== Table of Algorithms ==  


Currently no algorithms in our database for the given problem.
{| class="wikitable sortable"  style="text-align:center;" width="100%"


== Time Complexity graph ==
! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference


[[File:Line Clipping - Convex Polygonal Window - Time.png|1000px]]
|-


== Space Complexity graph ==
| [[Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping)|Cyrus–Beck]] || 1978 || $O(np)$ || $O({1})$ || Exact || Deterministic || [https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0097849378900213 Time]
|-
|}


[[File:Line Clipping - Convex Polygonal Window - Space.png|1000px]]
== Time Complexity Graph ==


== Pareto Decades graph ==
[[File:Line Clipping - Convex Polygonal Window - Time.png|1000px]]
 
[[File:Line Clipping - Convex Polygonal Window - Pareto Frontier.png|1000px]]


== References/Citation ==  
== References/Citation ==  


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

Latest revision as of 09:07, 28 April 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 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})$ Exact Deterministic Time

Time Complexity Graph

Error creating thumbnail: Unable to save thumbnail to destination

References/Citation

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