On the complexity of umbra and penumbra

DOI10.1016/j.comgeo.2008.04.007zbMath1194.65036OpenAlexW2108529414MaRDI QIDQ1028233

Julien Demouth, Raimund Seidel, Sylvain Lazard, Olivier Devillers, Hazel Everett, Marc Glisse

Publication date: 30 June 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00431418/file/CGTA_revised.pdf

zbMATH Keywords

combinatorial complexitydirect shadow castdiscontinuity meshpenumbra and umbra regions

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Minimizing visible edges in polyhedra ⋮ On the complexity of sets of free lines and line segments among balls in three dimensions

Cites Work

• Unnamed Item
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• The common exterior of convex polygons in the plane
• On incremental rendering of silhouette maps of a polyhedral scene
• Transversals to line segments in three-dimensional space
• Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra

This page was built for publication: On the complexity of umbra and penumbra