A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
[article]

2014
*
arXiv
*
pre-print

Let s be a source point and t be a destination point inside an n-vertex simple polygon P. Euclidean shortest paths and minimum-link paths between s and t inside P have been well studied. Both these kinds of paths are simple and piecewise-convex. However, computing optimal paths in the context of diffuse or specular reflections does not seem to be an easy task. A path from a light source s to t inside P is called a diffuse reflection path if the turning points of the path lie in the interiors of

arXiv:1304.4320v2
fatcat:owmrb2spo5an3c3mqucubyineu