Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. An algorithm for determining an opaque minimal forest of a convex polygon;Akman;Inform. Process. Lett.,1987
2. E.D. Demaine, J. O’Rourke, Open problems from CCCG 2007, in: Proc. of the 20th Canadian Conference on Computational Geometry, CCCG, 2008, pp. 183–190.
3. An O(n3) algorithm for finding the minimal opaque forest of a convex polygon;Dublish;Inform. Process. Lett.,1988
4. Computational geometry column 58;Dumitrescu;SIGACT News,2013
5. A. Dumitrescu, M. Jiang, The opaque square, in: Proc. of the 30th Annual Symposium on Computational Geometry, SOCG, 2014, pp. 529:529–529:538.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献