The orthogonal convex skull problem
type: Item
instance of: scholarly article
title: The orthogonal convex skull problem
zbMATH Open document ID: 0644.52003
DOI: 10.1007/BF02187918
author: D. Wood
author: Chee K. Yap
published in: Discrete \& Computational Geometry
publication date: 1988-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/131056
review text: 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.
Mathematics Subject Classification ID: 52A10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4050425
zbMATH Keywords: efficiency
zbMATH Keywords: maximal area convex polygon
zbMATH Keywords: potato peeling problem
MaRDI profile type: Publication
cites work: A polynomial solution for the Potato-peeling problem
cites work: Computing the Largest Empty Rectangle
cites work: On the definition and computation of rectilinear convex hulls
cites work: Measuring Concavity on a Rectangular Mosaic
OpenAlex ID: W1993363902
description: scientific article; zbMATH DE number 4050425