Convex Polyhedral Window (Line Clipping)

From Algorithm Wiki
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 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/doi/abs/10.1111/1467-8659.1510061