1. Asano, T.: Memory-constrained algorithms for simple polygons. Comput. Geom. Theory Appl. 46(8), 959–969 (2013)
2. Asano, T., Mulzer, W., Rote, G., Wang, Y.: Constant-work-space algorithms for geometric problems. J. Comput. Geom. 2(1), 46–68 (2011)
3. Asano, T., Mulzer, W., Wang, Y.: Constant-work-space algorithms for shortest paths in trees and simple polygons. J. Graph Algorithms Appl. 15(5), 569–586 (2011)
4. Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proceedings of 8th Canadian Conference on Computational Geometry (CCCG), pp. 38–43 (1996)
5. Baffier, J.F., Diez, Y., Korman, M.: Experimental study of compressed stack algorithms in limited memory environments. In: Proceedings of 17th International Symposium Experimental Algorithms (SEA), pp. 19:1–19:13 (2018)