On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra
Abstract
We prove that the lines tangent to four possibly intersecting convex polyhedra in $ ^3$ with $n$ edges in total form $\Theta(n^2)$ connected components in the worst case. In the generic case, each connected component is a single line, but our result still holds for arbitrary degenerate scenes. More generally, we show that a set of $k$ possibly intersecting convex polyhedra with a total of $n$ edges admits, in the worst case, $\Theta(n^2k^2)$ connected components of maximal free line segments tangent to any four of the polytopes. This bound also holds for the number of connected components of possibly occluded lines tangent to any four of the polytopes.
Domains
Other [cs.OH]
Loading...