The orthogonal convex skull problem

DOI10.1007/BF02187918zbMath0644.52003OpenAlexW1993363902MaRDI QIDQ1102544

Derick Wood, Chee-Keng Yap

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131056

zbMATH Keywords

efficiencymaximal area convex polygonpotato peeling problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (7)

Maximum-area and maximum-perimeter rectangles in polygons ⋮ Staircase visibility and computation of kernels ⋮ The orthogonal convex skull problem ⋮ On the area of intersection between two closed 2-D objects. ⋮ Finding the largest area axis-parallel rectangle in a polygon ⋮ Peeling meshed potatoes ⋮ Orthogonally convex covering of orthogonal polygons without holes

Cites Work

• On the definition and computation of rectilinear convex hulls
• A polynomial solution for the Potato-peeling problem
• The orthogonal convex skull problem
• Computing the Largest Empty Rectangle
• Measuring Concavity on a Rectangular Mosaic

This page was built for publication: The orthogonal convex skull problem