The orthogonal convex skull problem
The general problem is: finding a maximal area convex polygon contained in a given simple n-polygon (potato peeling problem). This problem can be solved in O(n 7) time. In this paper orthogonal versions of this problem are investigated where the edges of the polygons are parallel to two coordinate axes and that can be solved in O(n 2) time. Interesting polygons like ``Manhattan skylines'' and ``hidden eastern wings'' are studied.
scientific article; zbMATH DE number 4050425