Abstract
A setS ofn points in Euclideand-space determines a convex hull which can be triangulated into some numberm of simplices using the points ofS as vertices. We characterize those setsS for which all triangulations minimizem. This is used to characterize sets of points maximizing the volume of the smallest non-trivial simplex.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. O. Buchman andF. A. Valentine, A characterization of convex surfaces which are L-sets,Proc. A.M.S. 40 (1973), 235–239.
P. Erdős, G. Purdy andE. G. Straus, On a problem in combinatorial geometry,Discrete Math. 40 (1982), 45–52.
J. Komlós, J. Pintz andE. Szemerédi, On Heilbronn’s triangle problem,J. Lond Math. Soc. (2) 24 (1981), 385–396.
J. Komlós, J. Pintz andE. Szemerédi, A lower bound for Heilbronn’s problem,J. Lond. Math. Soc. (2) 25 (1982), 13–24.
R. P. Stanley, The number of faces of simplicial polytopes and spheres,to appear, Proc. N. Y. Acad. Sci.
R. P. Stanley, The upper bound conjecture and Cohen-Macauley Rings.Studies in Applied Math. 54 (1975) 135–142.
Author information
Authors and Affiliations
Additional information
Dedicated to Paul Erdős on his seventieth birthday
This work was supported in part by NSF Grants MCS 81-02519 and MCS 82-03347.
This work supported in part by NSF Grants MCS 81-02519 and MCS 82-03347