1. Amani, M., Biniaz, A., Bose, P., De Carufel, J. L., Maheshwari, A., Smid, M.: A plane 1.88-spanner for points in convex position. In: Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, pp. 25:1–25:14. Reykjavik, Iceland (2016)
2. Bose, P., Devroye, L., Löffler, M., Snoeyink, J., Verma, V.: Almost all Delaunay triangulations have stretch factor greater than
$$\pi /2$$
π
/
2
. Comput. Geom. 44(2), 121–127 (2011)
3. Brandt, A.F., Gaiowski, M.M., de Souza, C.C., de Rezende, P.J.: Minimum dilation triangulation reaching optimality efficiently. In: Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, pp. 61–66. Halifax, Canada (2014)
4. Cheong, O., Haverkort, H., Lee, M.: Computing a minimum-dilation spanning tree is NP-hard. In: Proceedings of the Thirteenth Australasian Symposium on Theory of Computing, CATS ’07, vol. 65, pp. 15–24 (2007)
5. CGAL, The Computational Geometry Algorithms Library.
http://www.cgal.org