Lower bounds for the number of small convex k-holes
View/Open
Cita com:
hdl:2117/26660
Document typeArticle
Defense date2014-07-01
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
Let S be a set of n points in the plane in general position, that is, no three points of S are on a line. We consider an Erdos-type question on the least number h(k)(n) of convex k-holes in S, and give improved lower bounds on h(k)(n), for 3 <= k <= 5. Specifically, we show that h(3)(n) >= n(2) - 32n/7 + 22/7, h(4)(n) >= n(2)/2 - 9n/4 - o(n), and h(5)(n) >= 3n/4 - o(n). We further settle several questions on sets of 12 points posed by Dehnhardt in 1987. (C) 2013 Elsevier B.V. All rights reserved.
CitationAichholzer, O. [et al.]. Lower bounds for the number of small convex k-holes. "Computational geometry: theory and applications", 01 Juliol 2014, vol. 47, núm. 5, p. 605-613.
ISSN0925-7721
Publisher versionhttp://www.sciencedirect.com/science/article/pii/S0925772113001703
Files | Description | Size | Format | View |
---|---|---|---|---|
afhhpv-lbnsc-13-cgta.pdf | 350,0Kb | View/Open |