Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra

DOI10.1137/S0097539705447116zbMath1138.65019OpenAlexW2055042442MaRDI QIDQ5386212

Hazel Everett, Olivier Devillers, Sylvain Lazard, Marc Glisse, Hyeon-Suk Na, Xavier Goaoc, Vida Dujmović, Hervé Brönnimann, S. H. Whitesides

Publication date: 22 April 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539705447116

zbMATH Keywords

algorithmcomputational geometrygraphical examples3D visibilityvisibility complexvisual eventsset of tangent linesthree-dimensional polyhedra

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Linear data structures for fast ray-shooting amidst convex polyhedra ⋮ On the complexity of sets of free lines and line segments among balls in three dimensions ⋮ A SUCCINCT 3D VISIBILITY SKELETON ⋮ On the degree of standard geometric predicates for line transversals in 3D ⋮ On the complexity of umbra and penumbra

This page was built for publication: Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra