On the complexity of umbra and penumbra

DOI10.1016/J.COMGEO.2008.04.007MaRDI QIDQ1028233zbMATH OpenOpenAlexFDO

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

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)

Review text

The authors analyze the combinatorial complexity of the direct shadow cast on a plane by a collection of 3D convex polyhedra illuminated by a \(1\)- or \(2\)-dimensional light source. Asymptotic upper and lower bounds on the maximum number of arcs in the boundaries between the full light, penumbra and umbra regions (the subsets of the plane from which the light source is, respectively, completely, partially visible and not at all visible) are given as functions of the number \(k\) of polyhedra and their total number \(n\) of triangles.

Recommendations

• Between umbra and penumbra
• scientific article; zbMATH DE number 739031
• Über scharfe Schattengrenzen und Schnitte konvexer Polytope. (Sharp shadow boundaries and sections of convex polytopes)
• Moser's shadow problem
• Linear-time algorithms for finding the shadow volumes from a convex area light source

Cites work

• scientific article; zbMATH DE number 1786501 (Why is no real title available?)
• Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
• On incremental rendering of silhouette maps of a polyhedral scene
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• The common exterior of convex polygons in the plane
• Transversals to line segments in three-dimensional space

Cited in

(5)

• Moser's shadow problem
• Between umbra and penumbra
• Shading models for point and linear sources
• On the complexity of sets of free lines and line segments among balls in three dimensions
• Minimizing visible edges in polyhedra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028233)