dc.contributor.author
Valtr, Pavel
dc.date.accessioned
2018-06-08T07:48:01Z
dc.date.available
2009-03-04T09:27:55.267Z
dc.identifier.uri
https://refubium.fu-berlin.de/handle/fub188/18741
dc.identifier.uri
http://dx.doi.org/10.17169/refubium-22427
dc.description.abstract
We describe a configuration (related to Horton's constructions) of n points in
general position in the plane with less than 1.8 n2 empty triangles less than
2.42 n2 empty quadrilaterals less than 1.46 n2 empty pentagons and less than
n2/3 emptyhexagons. It improves the constants shown by Bárány and Füredi.
en
dc.relation.ispartofseries
urn:nbn:de:kobv:188-fudocsseries000000000021-2
dc.rights.uri
http://www.fu-berlin.de/sites/refubium/rechtliches/Nutzungsbedingungen
dc.subject.ddc
000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung; Informatik
dc.title
On the minimum number of empty polygons in planar point sets
refubium.affiliation
Mathematik und Informatik
de
refubium.affiliation.other
Institut für Informatik
refubium.mycore.fudocsId
FUDOCS_document_000000000941
refubium.resourceType.isindependentpub
no
refubium.series.name
Freie Universität Berlin, Fachbereich Mathematik und Informatik
refubium.series.reportNumber
92-1
refubium.mycore.derivateId
FUDOCS_derivate_000000000233
dcterms.accessRights.openaire
open access
