Touring a sequence of polygons
From MaRDI portal
Publication:3581275
DOI10.1145/780542.780612zbMath1192.68354MaRDI QIDQ3581275
Moshe Dror, Joseph S. B. Mitchell, Alon Efrat, Anna Lubiw
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780612
Related Items
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons, Shortest paths in simple polygons with polygon-meet constraints, Query-point visibility constrained shortest paths in simple polygons, Visiting a Polygon on the Optimal Way to a Query Point