1. Aichholzer, O., et al.: Convexifying polygons without losing visibilities. In: 23rd Canadian Conference on Computational Geometry, CCCG 2011 (2011)
2. Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824–852 (2017)
3. Alamdari, S., et al.: Morphing planar graph drawings with a polynomial number of steps. In: Khanna, S. (ed.) 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, pp. 1656–1667 (2013)
4. Lecture Notes in Computer Science;P Angelini,2014
5. Angelini, P., Da Lozzo, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Symposium on Computational Geometry, vol. 34 of LIPIcs, pp. 126–140. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)