Author:
Alipour Sharareh,Zarei Alireza
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Compu- tational Geometry, Contemporary Mathematics, vol. 223, pp. 1–56. American Mathematical Society Press, Providence (1999)
2. Aronov, B., Guibas, L.J., Teichmann, M., Zhang, L.: Visibility queries and maintenance in simple polygons. Discrete and Computational Geometry 27, 461–483 (2002)
3. Asano, T.: An efficient algorithm for finding the visibility polygon for a polygonal region with holes. IEICE Transactions, 557–589 (1985)
4. Bose, P., Lubiw, A., Munro, J.I.: Eficient visibility queries in simple polygons. Computational Geometry Theory and Applications 23(7), 313–335 (2002)
5. Fischer, M., Hilbig, M., Jahn, C., auf der Heide, F.M., Ziegler, M.: Planar visibility counting. CoRR, abs/0810.0052 (2008)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献