Convex Polyhedral Window (Line Clipping)
Revision as of 11:20, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Convex Polyhedral Window (Line Clipping)}} == 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 == <pre>n: number of lines p: number of faces on pol...")
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