Publisher
Springer Nature Switzerland
Reference16 articles.
1. Aichholzer, O.: Convexifying polygons without losing visibilities. In: Aloupis, G. Bremner, (eds.) CCCG, pp. 229–234 (2011). http://www.cccg.ca/proceedings/2011/papers/paper70.pdf
2. Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824–852 (2017). https://doi.org/10.1137/16M1069171
3. Angelini, P., Da Lozzo, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Arge, L., Pach, J., (eds.) SoCG. LIPIcs, vol. 34 pp. 126–140. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015). https://doi.org/10.4230/LIPIcs.SOCG.2015.126
4. Arseneva, E., et al.: Pole dancing: 3D morphs for tree drawings. J. Graph Algorithms Appl. 23(3), 579–602 (2019). https://doi.org/10.7155/jgaa.00503
5. Arseneva, E., Gangopadhyay, R., Istomina, A.: Morphing tree drawings in a small 3D grid. J. Graph Algorithms Appl. 27(4), 241–279 (2023). https://doi.org/10.7155/jgaa.00623