The orthogonal convex skull problem (Q1102544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4050425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The orthogonal convex skull problem |
scientific article; zbMATH DE number 4050425 |
Statements
The orthogonal convex skull problem (English)
0 references
1988
0 references
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.
0 references
efficiency
0 references
maximal area convex polygon
0 references
potato peeling problem
0 references
0.7924251556396484
0 references
0.7773526310920715
0 references
0.7699248194694519
0 references
0.7689402103424072
0 references
