Peeling meshed potatoes

DOI10.1007/S00453-009-9346-8zbMATH Open1218.90181OpenAlexW2120554500MaRDI QIDQ534778FDOQ534778

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)

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

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

zbMATH Keywords

dynamic programminggeometric optimizationpotato peeling

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Peeling potatoes near-optimally in near-linear time
• A polynomial solution for the Potato-peeling problem
• Convex Polygons in Geometric Triangulations
• 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)