A polynomial solution for the Potato-peeling problem

DOI10.1007/BF02187692zbMath0593.52007MaRDI QIDQ1076347

B. George

Publication date: 1986

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

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

zbMATH Keywords

algorithm; polynomial; computational geometry; largest inscribed polygon; minimal area potato-peeling problem; minimal perimeter

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry

52A40: Inequalities and extremum problems involving convexity in convex geometry

52A10: Convex sets in (2) dimensions (including convex curves)

90C99: Mathematical programming