Shortest paths in weighted polygons.
Consider a polygon P and two points $p,\ q\in P.$ Suppose that to move from p to q, we can travel along the edges of P or through the interior of P. Assume that the speed at which we can travel along the edges of P is one unit per second, and the travel speed through the interior of P is 1/s units p...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
University of Ottawa (Canada)
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/10034 http://dx.doi.org/10.20381/ruor-8100 |