FAW
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...