4-Holes in point sets

View/Open
Cita com:
hdl:2117/26659
Document typeArticle
Defense date2014-08-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
We consider a variant of a question of Erdos on the number of empty k-gons (k-holes) in a set of n points in the plane, where we allow the k-gons to be non-convex. We show bounds and structural results on maximizing and minimizing the number of general 4-holes, and maximizing the number of non-convex 4-holes. In particular, we show that for n >= 9, the maximum number of general 4-holes is ((pi)(4)); the minimum number of general 4-holes is at least 5/2 n(2) - circle minus(n); and the maximum number of non-convex 4-holes is at least 1/2 n(3) - circle minus(n(2) logn) and at most 1/2 n(3) - circle minus(n(2)). 2014 (c) Elsevier B.V. All rights reserved.
CitationAichholzer, O. [et al.]. 4-Holes in point sets. "Computational geometry: theory and applications", 01 Agost 2014, vol. 47, núm. 6, p. 644-650.
ISSN0925-7721
Files | Description | Size | Format | View |
---|---|---|---|---|
afghhhuv-4hps-14.pdf | 296,0Kb | View/Open |