On empty pentagons and hexagons in planar point sets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10127506" target="_blank" >RIV/00216208:11320/12:10127506 - isvavai.cz</a>
Result on the web
<a href="http://crpit.com/confpapers/CRPITV128Valtr.pdf" target="_blank" >http://crpit.com/confpapers/CRPITV128Valtr.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On empty pentagons and hexagons in planar point sets
Original language description
We give improved lower bounds on the minimum number of k-holes (empty convex k-gons) in a set of n points in general position in the plane, for k = 5, 6
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/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
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
Eighteenth Computing: The Australasian Theory Symposium (CATS 2012), Melbourne, Australia, January 2012
ISBN
978-1-921770-09-8
ISSN
1445-1336
e-ISSN
—
Number of pages
2
Pages from-to
47-48
Publisher name
Australian Computer Society Inc.
Place of publication
Neuveden
Event location
Melbourne, Australia
Event date
Jan 30, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—