Fast computation of shortest watchman routes in simple polygons

Xuehou Tan. Fast computation of shortest watchman routes in simple polygons. Inf. Process. Lett., 77(1):27-33, 2001. [doi]

No reviews for this publication, yet.