Peeling meshed potatoes

DOI10.1007/S00453-009-9346-8MaRDI QIDQ534778zbMATH OpenOpenAlexFDO

Authors Boris Aronov, Maarten Löffler, Rodrigo I. Silveira, Marc Van Kreveld

Publication date 10 May 2011

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

dynamic programminggeometric optimizationpotato peeling

Mathematics Subject Classification ID

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

Recommendations

• A polynomial solution for the Potato-peeling problem
• Peeling potatoes near-optimally in near-linear time
• Peeling potatoes near-optimally in near-linear time
• How many potatoes are in a mesh?
• The orthogonal convex skull problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A polynomial solution for the Potato-peeling problem
• Angle-restricted tours in the plane.
• Delineating boundaries for imprecise regions
• Extremal polygon containment problems
• Finding large sticks and potatoes in polygons
• Finding the largest area axis-parallel rectangle in a polygon
• Geometric Knapsack problems
• INNER-COVER OF NON-CONVEX SHAPES
• On minimum-area hulls
• On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
• The Angular-Metric Traveling Salesman Problem
• The orthogonal convex skull problem

Cited in

(4)

• A polynomial solution for the Potato-peeling problem
• Convex Polygons in Geometric Triangulations
• Peeling potatoes near-optimally in near-linear time
• Peeling potatoes near-optimally in near-linear time

This page was built for publication: Peeling meshed potatoes

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