Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. 8th Canadian 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 Symposium on Computat. Geom. pp. 27–35 (2004)
3. Cheng, Q., Chrobak, M., Sundaram, G.: Computing simple paths among obstacles. Computational Geometry 16, 223–233 (2000)
4. Ghosh, S., Mount, D.: An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput. 20, 888–910 (1991)
5. Meisters, G.: Polygons have ears. Amer. Math. Monthly 82, 648–651 (1975)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献