Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra

Abstract : Motivated by visibility problems in three dimensions, we investigate the complexity and construction of the set of tangent lines in a scene of three-dimensional polyhedra. We prove that the set of lines tangent to four possibly intersecting convex polyhedra in $\Real^3$ with a total of $n$ edges consists of $\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 arbitrarily 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 at least four polytopes. Furthermore, these bounds also hold for possibly occluded lines rather than maximal free line segments. Finally, we present a $O(n^2 k^2 \log n)$ time and $O(nk^2)$ space algorithm that, given a scene of $k$ possibly intersecting convex polyhedra, computes all the \emph{minimal} free line segments that are tangent to any four of the polytopes and are isolated transversals to the set of edges they intersect; in particular, we compute at least one line segment per connected component of tangent lines.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00103916
Contributor : Sylvain Lazard <>
Submitted on : Monday, November 19, 2007 - 5:38:14 PM
Last modification on : Friday, September 20, 2019 - 4:56:41 PM
Long-term archiving on : Tuesday, April 6, 2010 - 6:30:23 PM

File

SIAM_final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, et al.. Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩. ⟨inria-00103916⟩

Share

Metrics

Record views

817

Files downloads

236