Author:
Kameda Tsunehiko,Suzuki Ichiro,Zhang John Z.
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Chazelle, B., Guibas, L.: Visibility and intersection problems in plane geometry. In: Proc. 3rd Annual Symp. on Computational Geometry, pp. 135–146 (1985)
2. Fukami, K., Ono, H., Sadakane, K., Yamashita, M.: Optimal polygon search by a boundary 1-searcher. In: Proc. Workshop on Foundations of Theoretical Computer Science: For New Computational View, RIMS, Kyoto University, January 2008, pp. 182–188 (2008)
3. Gabor, H., Tarjan, R.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences 30, 209–221 (1985)
4. Guibas, L., Latombe, J., LaValle, S., Lin, D., Motwani, R.: A visibility-based pursuit-evasion problem. Int’l. J. of Computational Geometry and Applications 9(5), 471–494 (1999)
5. Hopcroft, J., Ullman, J.: Set merging algorithm. SIAM J. Computing 2, 294–303 (1973)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献