Peeling meshed potatoes

DOI10.1007/s00453-009-9346-8zbMath1218.90181OpenAlexW2120554500MaRDI QIDQ534778

Rodrigo I. Silveira, Boris Aronov, Maarten Löffler, Marc J. van Kreveld

Publication date: 10 May 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9346-8

zbMATH Keywords

dynamic programminggeometric optimizationpotato peeling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Dynamic programming (90C39)

Related Items

Convex Polygons in Geometric Triangulations ⋮ Peeling Potatoes Near-Optimally in Near-Linear Time

Cites Work

• Unnamed Item
• Finding the largest area axis-parallel rectangle in a polygon
• Geometric Knapsack problems
• A polynomial solution for the Potato-peeling problem
• The orthogonal convex skull problem
• On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
• Extremal polygon containment problems
• On minimum-area hulls
• Delineating boundaries for imprecise regions
• Angle-restricted tours in the plane.
• Finding large sticks and potatoes in polygons
• INNER-COVER OF NON-CONVEX SHAPES
• The Angular-Metric Traveling Salesman Problem