Convex Polyhedral Window: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of lines | $n$: number of lines | ||
p: number of faces on polyhedron | $p$: number of faces on polyhedron | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 07:52, 10 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 polyhedron.
Related Problems
Subproblem: Convex Polygonal Window
Related: Rectangular Window
Parameters
$n$: number of lines
$p$: number of faces on polyhedron
Table of Algorithms
Currently no algorithms in our database for the given problem.
References/Citation
https://onlinelibrary-wiley-com.ezproxy.canberra.edu.au/doi/abs/10.1111/1467-8659.1510061