Author:
Nouri Bygi Mojtaba,Daneshpajouh Shervin,Alipour Sharareh,Ghodsi Mohammad
Subject
Applied Mathematics,Computational Mathematics
Reference19 articles.
1. Efficient visibility queries in simple polygons;Bose;Comput. Geom., Theory Appl.,2002
2. S. Suri, J. O’Rourke, Worst-case optimal algorithms for constructing visibility polygons with holes, in: Proceedings of Annual Symposium on Computational Geometry, 1984, pp. 14–23.
3. J. Gudmundsson, P. Morin, Planar visibility: testing and counting, in: Proceedings of Annual Symposium on Computational Geometry, 2010, pp. 77–86.
4. S. Alipour, A. Zarei, Visibility testing and counting, in: Proceedings of FAW-AAIM, 2011, pp. 343–351.
5. Space/query-time trade-off for computing the visibility polygon;Nouri;Comput. Geom., Theory Appl.,2013
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimizing Visible Edges in Polyhedra;Graphs and Combinatorics;2023-09-14