Funder
JSPS
National Natural Science Foundation of China
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. T. Auer, M. Held, Heuristics for the generation of random polygons, in: Proc. 8th Canadian Conf. on Comput. Geom., 1996, pp. 38-44.
2. B. Ben-Moshe, O. Hall-Holt, M.J. Katz, J.S.B. Mitchell, Computing the visibility graph of points within a polygon, in: Proc. ACM Sympos. Comput. Geom., 2004, pp. 27-35.
3. Visibility and intersection problem in plane geometry;Chazelle;Discrete Comput. Geom.,1989
4. Computing simple paths among obstacles;Cheng;Comput. Geom.,2000
5. Introduction to Algorithms;Corman,2009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Spanning simple path inside a simple polygon;The Journal of Supercomputing;2022-08-22