A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The Visual Computer
Let s be a point source of light inside a polygon P of n vertices. A polygonal path from s to some point t inside P is called a diffuse reflection path if the turning points of the path lie on polygonal edges of P . We present three different algorithms for computing diffuse reflection paths from s to t inside P . For constructing such a path, the first algorithm uses a greedy method, the second algorithm uses a transformation of a minimum link path, and the third algorithm uses the edge-edgedoi:10.1007/s00371-011-0670-z fatcat:k5h5zyboyvaibbioqz5fcjs3na