On the complexity of umbra and penumbra (Q1028233): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4547793 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The common exterior of convex polygons in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transversals to line segments in three-dimensional space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On incremental rendering of silhouette maps of a polyhedral scene / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar realizations of nonlinear Davenport-Schinzel sequences by segments / rank | |||
Normal rank |
Latest revision as of 18:08, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of umbra and penumbra |
scientific article |
Statements
On the complexity of umbra and penumbra (English)
0 references
30 June 2009
0 references
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.
0 references
discontinuity mesh
0 references
combinatorial complexity
0 references
direct shadow cast
0 references
penumbra and umbra regions
0 references