Author:
Chin Wei-Pang,Ntafos Simeon
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference5 articles.
1. [CN] W. P. Chin and S. Ntafos, Optimum watchman routes,Inform. Process. Lett. 28 (1988), 39–44; preliminary version inProceedings of the 2nd ACM Symposium on Computational Geometry, pp. 24–33, 1986.
2. [GH*] L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan, Linear time algorithms for visibility and shortest path problems inside simple polygons,Proceedings of the ACM Symposium on Computational Geometry, pp. 1–13, 1986.
3. [O] J. O'Rourke,Art Gallery Theorems and Algorithms, Oxford University Press, Oxford, 1987.
4. [S] S. Suri, Minimum Link Paths in Polygons and Related Problems, Ph.D. Dissertation, John Hopkins University, 1987.
5. [TV] R.E. Tarjan and C. Van Wyk, An O(n log logn) algorithm for triangulating a simple polygon,SIAM J. Comput. 17 (1988), 143–178.
Cited by
70 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献