PEELING POTATOES NEAR-OPTIMALLY IN NEAR-LINEAR TIME

Cabello, S; Cibulka, J; Kyncl, J; Saumell, M; Valtr, P

Cabello, S (reprint author), Univ Ljubljana, IMFM, Dept Math, Ljubljana 1000, Slovenia.; Cabello, S (reprint author), Univ Ljubljana, Dept Math, FMF, Ljubljana 1000, Slovenia.

SIAM JOURNAL ON COMPUTING, 2017; 46 (5): 1574

Abstract

We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon P with n vertices.......

Full Text Link