Peeling potatoes near-optimally in near-linear time
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43922374" target="_blank" >RIV/49777513:23520/14:43922374 - isvavai.cz</a>
Result on the web
<a href="http://dl.acm.org/citation.cfm?id=2582159" target="_blank" >http://dl.acm.org/citation.cfm?id=2582159</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2582112.2582159" target="_blank" >10.1145/2582112.2582159</a>
Alternative languages
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 MINUS SIGN eps)-approximation algorithm for this problem: in O((n/eps^6) log^2 n log(1/?)) time we find a convex polygon contained in P that, with probability at least 1 MINUS SIGN ?, has area at least (1 MINUS SIGN eps) times the area of an optimal solution.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/EE2.3.30.0038" target="_blank" >EE2.3.30.0038: New excellence in human resources</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the thirtieth annual symposium on Computational geometry
ISBN
978-1-4503-2594-3
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
224-231
Publisher name
ACM
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
—