A subset A of a finite set P of points in the plane is called an empty polygon, if each point of A is a vertex of the convex hull of A and the convex hull of A contains no other points of P. We construct a set of n points in general position in the plane with only ˜1.62n2 empty triangles, ˜1.94n2 empty quadrilaterals, ˜1.02n2 empty pentagons, and ˜0.2n2 empty hexagons.
-
Bárány, I. and Füredi, Z., Empty simplices in Euclidean space, Canadian Math. Bull. 30 (1987), 436-445. MR 89g:52004
'Empty simplices in Euclidean space ' () 30 Canadian Math. Bull. : 436 -445.
-
Bárány, I. and Károlyi, Gy., problems and results around the erdös-szekeres convex polygon theorem, lect. notes comput. sci. 2098 (2001), 91-105.
'Problems and results around the erdös-szekeres convex polygon theorem ' () 2098 Lect. notes comput. sci. : 91 -105.
-
dumitrescu, A., Planar sets with few empty convex polygons, Stud. Sci. Math. Hung. 36 (2000), 93-109. MR 2001f:52037
'Planar sets with few empty convex polygons ' () 36 Stud. Sci. Math. Hung. : 93 -109.
-
Edelman, P. and Reiner, V., Counting the interior of a point configuration, Discrete Comput. Geom. 23 (2000), 1-13. MR 2000i:52028
'Counting the interior of a point configuration ' () 23 Discrete Comput. Geom. : 1 -13.
-
Erdös, P., On some problems of elementary and combinatorial geometry, Ann. Mat. Pura. Appl. (4) 103 (1975), 99-108. MR 54#113
'On some problems of elementary and combinatorial geometry ' () (4) 103 Ann. Mat. Pura. Appl. : 99 -108.
-
Erdös, P. and Szekeres, Gy., A combinatorial problem in geometry, Compositio Math. 2 (1935), 464-470.
'A combinatorial problem in geometry ' () 2 Compositio Math. : 464 -470.
-
Hardy, G. H. and Wright, E. M., An introduction to the Theory of Numbers, 5th ed., Clarendon Press (Oxford) 1979. MR 81i:10002
An introduction to the Theory of Numbers , ().
-
Horton, J. D., Sets with no empty convex 7-gons, Canadian Math. Bull. 26 (1983), 482-484. MR 85f:52007
'Sets with no empty convex 7-gons, Canadian Math. ' () 26 Bull. : 482 -484.
-
Katchalski, M. and Meir, A., On empty triangles determined by points in the plane, Acta. Math. Hungar. 51 (1988), 323-328. MR 89f:52021
'On empty triangles determined by points in the plane ' () 51 Acta. Math. Hungar. : 323 -328.
-
Valtr, P., Convex independent sets and 7-holes in restricted planar point sets, Discrete Comput. Geom. 7 (1992), 135-152. MR 93e:52037
'Convex independent sets and 7-holes in restricted planar point sets ' () 7 Discrete Comput. Geom. : 135 -152.
-
Ahrens, C., Gordon, G. and Mcmahon, E. W., Convexity and the beta invariant, Discrete Comput Geom. 22 (1999), 411-424. MR 2000j:52007
'Convexity and the beta invariant ' () 22 Discrete Comput Geom. : 411 -424.
-
Balog, A. and Deshouillers, J-M., On some convex lattice polytopes, in: Number theory in progress, Volume 2: Elementary and analytic number theory (K. Györy et al., eds.), de Gruyter, Berlin 1999, 591-606. MR 2000f:11083
Number theory in progress, Volume 2: Elementary and analytic number theory , () 591 -606.
-
Valtr, P., On the minimum number of empty polygons in planar point sets, Studia Sci. Math. Hung. 30 (1995), 155-163. MR 96e:52019
'On the minimum number of empty polygons in planar point sets ' () 30 Studia Sci. Math. Hung. : 155 -163.
Monthly Content Usage
| Abstract Views | Full Text Views | PDF Downloads | |
|---|---|---|---|
| Aug 2020 | 2 | 0 | 0 |
| Sep 2020 | 2 | 0 | 0 |
| Oct 2020 | 2 | 1 | 1 |
| Nov 2020 | 9 | 0 | 0 |
| Dec 2020 | 1 | 0 | 0 |
| Jan 2021 | 1 | 0 | 0 |
| Feb 2021 | 0 | 0 | 0 |
Copyright Akadémiai Kiadó
AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Copyright Akadémiai Kiadó AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Powered by PubFactory