The orthogonal convex skull problem

DOI10.1007/BF02187918MaRDI QIDQ1102544zbMATH OpenOpenAlexFDO

Authors D. Wood, Chee K. 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

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

Recommendations

• A polynomial solution for the Potato-peeling problem
• Orthogonally convex covering of orthogonal polygons without holes
• scientific article; zbMATH DE number 4213490
• Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon
• Finding the convex hull of a simple polygon in linear time

Cites work

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

Cited in

(9)

• A polynomial solution for the Potato-peeling problem
• Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon
• The orthogonal convex skull problem
• On the area of intersection between two closed 2-D objects.
• Orthogonally convex covering of orthogonal polygons without holes
• Staircase visibility and computation of kernels
• Peeling meshed potatoes
• Finding the largest area axis-parallel rectangle in a polygon
• Maximum-area and maximum-perimeter rectangles in polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102544)