Peeling Potatoes Near-Optimally in Near-Linear Time

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10272054" target="_blank" >RIV/00216208:11320/14:10272054 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/2582112.2582159" target="_blank" >http://dx.doi.org/10.1145/2582112.2582159</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2582112.2582159" target="_blank" >10.1145/2582112.2582159</a>

Result language
angličtina
Original language name
Peeling Potatoes Near-Optimally in Near-Linear Time
Original language description
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon P with n vertices. We give a randomized near-linear-time (1-epsilon)-approximation algorithm for this problem: in O((n/epsilon^6) log_2 n log(1/delta)) time we find a convex polygon contained in P that, with probability at least 1 - delta, has area at least (1- epsilon) times the area of an optimal solution.
Czech name
—
Czech description
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the thirtieth annual symposium on Computational geometry
ISBN
978-1-4503-2031-3
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
224-231
Publisher name
Association for Computing Machinery
Place of publication
New York, USA
Event location
Kyoto, Japan
Event date
Jun 8, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)