Geodesic
Empty Simplices in Euclidean Space
Canadian mathematical bulletin, Tome 30 (1987) no. 4, pp. 436-445

Voir la notice de l'article provenant de la source Cambridge University Press

Let P - {p1,p2,. . . ,pn} be an independent point-set in Rd (i.e., there are no d + 1 on a hyperplane). A simplex determined by d + 1 different points of P is called empty if it contains no point of P in its interior. Denote the number of empty simplices in P by fd(P). Katchalski and Meir pointed out that . Here a random construction P n is given with , where K(d) is a constant depending only on d. Several related questions are investigated.
DOI : 10.4153/CMB-1987-064-1
Mots-clés : Primary 52A37, Secondary 10K30 
Bárány, Imre; Füredi, Zoltán. Empty Simplices in Euclidean Space. Canadian mathematical bulletin, Tome 30 (1987) no. 4, pp. 436-445. doi: 10.4153/CMB-1987-064-1
@article{10_4153_CMB_1987_064_1,
     author = {B\'ar\'any, Imre and F\"uredi, Zolt\'an},
     title = {Empty {Simplices} in {Euclidean} {Space}},
     journal = {Canadian mathematical bulletin},
     pages = {436--445},
     year = {1987},
     volume = {30},
     number = {4},
     doi = {10.4153/CMB-1987-064-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-064-1/}
}
TY  - JOUR
AU  - Bárány, Imre
AU  - Füredi, Zoltán
TI  - Empty Simplices in Euclidean Space
JO  - Canadian mathematical bulletin
PY  - 1987
SP  - 436
EP  - 445
VL  - 30
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-064-1/
DO  - 10.4153/CMB-1987-064-1
ID  - 10_4153_CMB_1987_064_1
ER  - 
%0 Journal Article
%A Bárány, Imre
%A Füredi, Zoltán
%T Empty Simplices in Euclidean Space
%J Canadian mathematical bulletin
%D 1987
%P 436-445
%V 30
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-064-1/
%R 10.4153/CMB-1987-064-1
%F 10_4153_CMB_1987_064_1

[1] 1. Bárány, I., A generalization of Carathéodory's theorem, Discrete Math. 40 (1982), pp. 141 — 152. Google Scholar

[2] 2. Boros, E. and Füredi, Z., The number of triangles covering the center of an n-set, Geometriae Dedicata 17(1984), pp. 69– 77. Google Scholar

[3] 3. Danzer, L., Grünbaum, B. and Klee, V., Helly's theorem and its relatives, Proc. Sympos. Pure. Math., Vol. 7, AMS, Providence, R.I. 1963, pp. 101–108. Google Scholar

[4] 4. Erdös, P., On some problems of elementary and combinatorial geometry, Ann. Mat. Pura. Appl. (4) 103(1975), pp. 99–108. Google Scholar

[5] 5. Erdös, P. and Szekeres, G., A combinatorial problem in geometry, Compositio Math. 2 (1935), pp. 463–470. Google Scholar

[6] 6. Fabella, G. and O'Rourke, J., Twenty-two points with no empty hexagon (1986, manuscript). Google Scholar

[7] 7. Grünbaum, B., Convex poly topes, N.Y., 1967. Google Scholar

[8] 8. Harborth, H., Konvexe Funfecke in ebenen Punktmengen, Elem. Math. 33 (1978), pp. 116–118. Google Scholar

[9] 9. Horton, J.D., Sets with no empty convex 7-gons, Canadian Math. Bull. 26 (1983), pp. 482–484. Google Scholar

[10] 10. John, F., Extremum problems with inequalities as subsidiary conditions, Courant Ann. Volume , Interscience, N.Y., 1948, pp. 187–204. Google Scholar

[11] 11. Katchalski, M. and Meir, A., On empty triangles determined by points in the plane, Acta. Math. Hungar. (to appear). Google Scholar

[12] 12. McMullen, P., The maximum number of faces of a convex polytope, Mathematika 17 (1970), pp. 179–184. Google Scholar

[13] 13. Purdy, G.B., The minimum number of empty triangles, AMS Abstract 3 (1982), p. 318. Google Scholar

Cité par Sources :