Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference12 articles.
1. Computing the convex hull of line intersections;Atallah;J. Algorithms,1986
2. Approximating the shortest watchman route in a simple polygon, Technical Report;Carlsson,1997
3. Finding the shortest watchman route in a simple polygon;Carlsson;Discrete Comput. Geom.,1999
4. Shortest watchman routes in simple polygons;Chin;Discrete Comput. Geom.,1991
5. The Euclidean traveling salesman problem with neighborhoods and a connecting fence, PhD Thesis;Jonsson,2000
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献