1. Abello, J.M., Pardalos, P.M., Resende, M.G.C. (eds.): Handbook of Massive Data Sets, vol. I. Springer, Heidelberg (2002)
2. Aronov, B., van Kreveld, M., Löffler, M., Silveira, R.I.: Peeling meshed potatoes. Algorithmica 60(2), 349–367 (2011)
3. Lecture Notes in Computer Science;G Borgefors,2005
4. Cabello, S., Cibulka, J., Kynčl, J., Saumell, M., Valtr, P.: Peeling potatoes near-optimally in near-linear time. In: Proc. 13th Annual Symposium on Computational Geometry, SOCG 2014, Kyoto, Japan. pp. 224–231. ACM, New York (2014)
5. Chang, J., Yap, C.: A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems. In: Proceedings of the 25th Annual Symposium on Foundations of Computer Science, SFCS 1984, Singer Island, Florida, pp. 408–416. IEEE Computer Society, Washington, DC (1984)