1. Croft H T, Falconer K, and Guy R K, Unsolved Problems in Geometry: Unsolved Problems in Intuitive Mathematics, Springer Science and Business Media, Berlin, 2012.
2. Boyce J E, Dobkin D P, Drysdale R L, et al., Finding extremal polygons, SIAM J. Comput., 1985, 14(1): 134–147.
3. Eppstein D, New algorithms for minimum area k-gons, Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, Ed. by Prederickson G N, Florida, 1992, 83–88.
4. Eppstein D, Overmars M H, Rote G, et al., Finding minimum area k-gons, Discret. Comput. Geom., 1992, 7(1): 45–58.
5. Mankowski M and Moshkov M, Convex polygon triangulation, Dynamic Programming Multi-Objective Combinatorial Optimization, Eds. by Mankowski M and Moshkov M, Springer, Berlin, 2021, 99–109.