Abstract
Let n (k, l) be the smallest integer such that any set of n (k, l) points in the plane, no three collinear, contains both an empty convex k -gon and an empty convex l -gon, which do not intersect. We show that n (3,5) = 10, 12 ≤ n (4,5) ≤ 14, 16 ≤ n (5,5) ≤ 20.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Erdős, P.: Some combinatorial problems in geometry. In: Proceedings Conference University Haifa. Lecture Notes in Mathematics, vol. 792, pp. 46–53 (1980)
Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math. 2, 463–470 (1935)
Harborth, H.: Konvexe Fünfecke in ebenen Punktmengen. Elem. Math. 33, 116–118 (1978)
Horton, J.D.: Sets with no empty convex 7-gons. Canad. Math. Bull. 26, 482–484 (1983)
Hosono, K., Urabe, M.: On the number of disjoint convex quadrilaterals for a plannar point set. Comp. Geom. Theory Appl. 20, 97–104 (2001)
Urabe, M.: On a partition into convex polygons. Disc. Appl. Math. 64, 179–191 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hosono, K., Urabe, M. (2005). On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons. In: Akiyama, J., Kano, M., Tan, X. (eds) Discrete and Computational Geometry. JCDCG 2004. Lecture Notes in Computer Science, vol 3742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589440_12
Download citation
DOI: https://doi.org/10.1007/11589440_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30467-8
Online ISBN: 978-3-540-32089-0
eBook Packages: Computer ScienceComputer Science (R0)