Author:
Akitaya Hugo A.,Aloupis Greg,Erickson Jeff,Tóth Csaba D.
Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference19 articles.
1. Abel, Z., Demaine, E.D., Demaine, M.L., Eppstein, D., Lubiw, A., Uehara, R.: Flat foldings of plane graphs with prescribed angles and edge lengths. In: Möhring, R., Raman, R. (eds.) Graph Drawing (GD’14). Lecture Notes in Computer Science, vol. 8871, pp. 272–283. Springer, Heidelberg (2014)
2. Arkin, E.M., Bender, M.A., Demaine, E.D., Demaine, M.L., Mitchell, J.S.B., Sethia, S., Skiena, S.S.: When can you fold a map? Comput. Geom. 29(1), 23–46 (2004)
3. Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: Duncan, C., Symvonis, A. (eds.) Algorithms—ESA 2002. Lecture Notes in Computer Science, vol. 2461, pp. 152–164. Springer, Berlin (2002)
4. Bern, M., Hayes, B.: The complexity of flat origami. In: Proceedings of the the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175–183. ACM, New York (1996)
5. Chang, H.-C., Erickson, J., Xu, C.: Detecting weakly simple polygons. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1655–1670. SIAM, Philadelphia (2015)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献