Illumination problem¶
Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.
Core Idea¶
Illumination problem is treated here as the recurring computational geometry identity summarized by this source-grounded definition: Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources. 's solution of the illumination problem using elliptical arcs (blue) and straight line segments (green), with 3 positions of the single light source (red spot). The purple crosses are the foci of the larger arcs. Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.
Scope of Application¶
-
Original formulation. The original formulation was attributed to Ernst Straus in the 1950s and has been resolved.
-
Original formulation. Straus asked whether a room with mirrored walls can always be illuminated by a single point light source, allowing for repeated reflection of light off the mirrored walls.
-
Penrose unilluminable room. The original problem was first solved in 1958 by Roger Penrose using ellipses to form the Penrose unilluminable room.
-
Penrose unilluminable room. He showed that there exists a room with curved walls that must always have dark regions if lit only by a single point source.
-
Polygonal rooms. These were rare cases, when a finite number of dark points (rather than regions) are unilluminable only from a fixed position of the point source.
Clarity¶
A clear use of Illumination problem names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.
Manages Complexity¶
Illumination problem compresses multiple computational geometry details into a stable diagnostic relation. The source shows both the central mechanism—the original problem was first solved in 1958 by Roger Penrose using ellipses to form the Penrose unilluminable room.—and the practical consequence—this problem was also solved for polygonal rooms by George Tokarsky in 1995 for 2 and 3 dimensions, which showed that there exists an unilluminable polygonal 26-sided room.
Abstract Reasoning¶
- Type the carrier. Identify the computational geometry entities to which the claim applies.
- State the relation. Use the source-grounded identity: Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.
- Check operation and conditions. He showed that there exists a room with curved walls that must always have dark regions if lit only by a single point source.
- Demand recognition evidence.
Knowledge Transfer¶
Within the home domain. Knowledge about Illumination problem transfers literally when a new case preserves the same carrier type, relation, and recognition test. The original formulation was attributed to Ernst Straus in the 1950s and has been resolved. Straus asked whether a room with mirrored walls can always be illuminated by a single point light source, allowing for repeated reflection of light off the mirrored walls. Beyond the home domain. No canonical parent is asserted for Illumination problem.
Neighborhood in Abstraction Space¶
Illumination problem sits in a sparse region of the domain-specific corpus (83rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Named Physical Phenomena & Theoretical Constructs (16 abstractions)
Nearest neighbors
- Conical refraction — 0.84
- Polyconic Projection Class — 0.82
- Lie group — 0.82
- Violating cosmic censorship — 0.81
- Perspective (graphical) — 0.81
Computed from structural-signature embeddings · 2026-10-08