Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.
Illumination problems are a class of mathematical problems that study the illumination of rooms with mirrored walls by point light sources.
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. Alternatively, the question can be stated as asking that if a billiard table can be constructed in any required shape, is there a shape possible such that there is a point where it is impossible to hit the billiard ball at another point, assuming the ball is point-like and continues infinitely rather than stopping due to friction.
The original problem was first solved in 1958 by Roger Penrose using ellipses to form the 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.
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 with a "dark spot" which is not illuminated from another point in the room, even allowing for repeated reflections. [1] 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.
In 1995, Tokarsky found the first polygonal unilluminable room which had 4 sides and two fixed boundary points. [2] He also in 1996 found a 20-sided unilluminable room with two distinct interior points. In 1997, two different 24-sided rooms with the same properties were put forward by George Tokarsky and David Castro separately. [3] [4]
In 2016, Samuel Lelièvre, Thierry Monteil, and Barak Weiss showed that a light source in a polygonal room whose angles (in degrees) are all rational numbers will illuminate the entire polygon, with the possible exception of a finite number of points. [5] In 2019 this was strengthened by Amit Wolecki who showed that for each such polygon, the number of pairs of points which do not illuminate each other is finite. [6]
John Horton Conway was an English mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He also made contributions to many branches of recreational mathematics, most notably the invention of the cellular automaton called the Game of Life.
In 3D computer graphics, radiosity is an application of the finite element method to solving the rendering equation for scenes with surfaces that reflect light diffusely. Unlike rendering methods that use Monte Carlo algorithms, which handle all types of light paths, typical radiosity only account for paths which leave a light source and are reflected diffusely some number of times before hitting the eye. Radiosity is a global illumination algorithm in the sense that the illumination arriving on a surface comes not just directly from the light sources, but also from other surfaces reflecting light. Radiosity is viewpoint independent, which increases the calculations involved, but makes them useful for all viewpoints.
Daylighting is the practice of placing windows, skylights, other openings, and reflective surfaces so that direct or indirect sunlight can provide effective internal lighting. Particular attention is given to daylighting while designing a building when the aim is to maximize visual comfort or to reduce energy use. Energy savings can be achieved from the reduced use of artificial (electric) lighting or from passive solar heating. Artificial lighting energy use can be reduced by simply installing fewer electric lights where daylight is present or by automatically dimming or switching off electric lights in response to the presence of daylight – a process known as daylight harvesting.
In Euclidean geometry, a kite is a quadrilateral with reflection symmetry across a diagonal. Because of this symmetry, a kite has two equal angles and two pairs of adjacent equal-length sides. Kites are also known as deltoids, but the word deltoid may also refer to a deltoid curve, an unrelated geometric object sometimes studied in connection with quadrilaterals. A kite may also be called a dart, particularly if it is not convex.
Shading refers to the depiction of depth perception in 3D models or illustrations by varying the level of darkness. Shading tries to approximate local behavior of light on the object's surface and is not to be confused with techniques of adding shadows, such as shadow mapping or shadow volumes, which fall under global behavior of light.
A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries.
In geometry, an arrangement of lines is the subdivision of the plane formed by a collection of lines. Problems of counting the features of arrangements have been studied in discrete geometry, and computational geometers have found algorithms for the efficient construction of arrangements.
In geometry, a simple polygon is a polygon that does not intersect itself and has no holes. That is, it is a piecewise-linear Jordan curve consisting of finitely many line segments. These polygons include as special cases the convex polygons, star-shaped polygons, and monotone polygons.
Richard Evan Schwartz is an American mathematician notable for his contributions to geometric group theory and to an area of mathematics known as billiards. Geometric group theory is a relatively new area of mathematics beginning around the late 1980s which explores finitely generated groups, and seeks connections between their algebraic properties and the geometric spaces on which these groups act. He has worked on what mathematicians refer to as billiards, which are dynamical systems based on a convex shape in a plane. He has explored geometric iterations involving polygons, and he has been credited for developing the mathematical concept known as the pentagram map. In addition, he is author of a mathematics picture book for young children. In 2018 he is a professor of mathematics at Brown University.
In geometry, the Heesch number of a shape is the maximum number of layers of copies of the same shape that can surround it with no overlaps and no gaps. Heesch's problem is the problem of determining the set of numbers that can be Heesch numbers. Both are named for geometer Heinrich Heesch, who found a tile with Heesch number 1 and proposed the more general problem.
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the -dimensional Euclidean space . Most texts use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary.
Nonimaging optics is a branch of optics that is concerned with the optimal transfer of light radiation between a source and a target. Unlike traditional imaging optics, the techniques involved do not attempt to form an image of the source; instead an optimized optical system for optimal radiative transfer from a source to a target is desired.
Outer billiards is a dynamical system based on a convex shape in the plane. Classically, this system is defined for the Euclidean plane but one can also consider the system in the hyperbolic plane or in other spaces that suitably generalize the plane. Outer billiards differs from a usual dynamical billiard in that it deals with a discrete sequence of moves outside the shape rather than inside of it.
Hippocrates of Chios was an ancient Greek mathematician, geometer, and astronomer.
Geometry is a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space. Geometry is one of the oldest mathematical sciences.
In mathematics, the Schoenflies problem or Schoenflies theorem, of geometric topology is a sharpening of the Jordan curve theorem by Arthur Schoenflies. For Jordan curves in the plane it is often referred to as the Jordan–Schoenflies theorem.
A reflector sight or reflex sight is an optical sight that allows the user to look through a partially reflecting glass element and see an illuminated projection of an aiming point or some other image superimposed on the field of view. These sights work on the simple optical principle that anything at the focus of a lens or curved mirror will appear to be sitting in front of the viewer at infinity. Reflector sights employ some form of "reflector" to allow the viewer to see the infinity image and the field of view at the same time, either by bouncing the image created by lens off a slanted glass plate, or by using a mostly clear curved glass reflector that images the reticle while the viewer looks through the reflector. Since the reticle is at infinity, it stays in alignment with the device to which the sight is attached regardless of the viewer's eye position, removing most of the parallax and other sighting errors found in simple sighting devices.
A Penrose tiling is an example of an aperiodic tiling. Here, a tiling is a covering of the plane by non-overlapping polygons or other shapes, and a tiling is aperiodic if it does not contain arbitrarily large periodic regions or patches. However, despite their lack of translational symmetry, Penrose tilings may have both reflection symmetry and fivefold rotational symmetry. Penrose tilings are named after mathematician and physicist Roger Penrose, who investigated them in the 1970s.
A set of prototiles is aperiodic if copies of the prototiles can be assembled to create tilings, such that all possible tessellation patterns are non-periodic. The aperiodicity referred to is a property of the particular set of prototiles; the various resulting tilings themselves are just non-periodic.
In recreational mathematics, arithmetic billiards provide a geometrical method to determine the least common multiple and the greatest common divisor of two natural numbers by making use of reflections inside a rectangle whose sides are the two given numbers. This is an easy example of trajectory analysis of dynamical billiards.