Publisher
Springer International Publishing
Reference10 articles.
1. Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. 8th Candian Conf. on Comput. Geom., pp. 38–44 (1996)
2. Ben-Moshe, B., Hall-Holt, O., Katz, M.J., Mitchell, J.S.B.: Computing the visibility graph of points within a polygon. In: Proc. ACM Sympos. Comput. Geom., pp. 27–35 (2004)
3. Cheng, Q., Chrobak, M., Sundaram, G.: Computing simple paths among obstacles. Comput. Geom. 16, 223–233 (2000)
4. Chazelle, B., Guibas, L.: Visibility and intersection problem in plane geometry. Discrete Comput. Geom. 4, 551–581 (1989)
5. Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 3nd edn. The MIT Press (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献