On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
From MaRDI portal
Publication:1151600
DOI10.1007/BF00183192zbMath0458.52005OpenAlexW2028071467MaRDI QIDQ1151600
Publication date: 1981
Published in: Geometriae Dedicata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00183192
Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
A polynomial solution for the Potato-peeling problem ⋮ Maximum-area and maximum-perimeter rectangles in polygons ⋮ Finding a largest-area triangle in a terrain in near-linear time ⋮ Lattice-theoretical fixpont theorems in morphological image filtering ⋮ An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ Convex Polygons in Geometric Triangulations ⋮ Peeling Potatoes Near-Optimally in Near-Linear Time ⋮ Large \(k\)-gons in a 1.5D terrain ⋮ Largest triangle inside a terrain ⋮ On the Beer index of convexity and its variants ⋮ The convexification effect of Minkowski summation ⋮ Peeling meshed potatoes
