1. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications (Springer-Verlag New York, Inc., Secaucus, NJ, 1997)
2. J. O’Rourke, Art Gallery Theorems and Algorithms (Oxford University Press Inc, New York, NY, 1987)
3. T. Auer, M. Held, Heuristics for the generation of random polygons, in Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, (Carleton University, Ottawa, 1996), pp. 38–43
4. W. Mulzer, G. Rote, Minimum-weight triangulation is np-hard. J. ACM 55(2), 11:1–11:29 (2008)
5. C. Pelaez, A. Ramrez-Vigueras, and J. Urrutia. Triangulations with many points of even degree, in Proceedings of the 22nd Annual Canadian Conference on Computational Geometry (2010), pp. 103–106