Shortest watchman routes in simple polygons
- 1 March 1991
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 6 (1) , 9-31
- https://doi.org/10.1007/bf02574671
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Optimum watchman routesInformation Processing Letters, 1988
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- Linear time algorithms for visibility and shortest path problems inside simple polygonsPublished by Association for Computing Machinery (ACM) ,1986