Abstract
In this paper we will present some results related to the upper bound of Heilbronn number for eight points in triangles and the approximate shape of the optimal configurations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cantrell D (2011) The Heilbronn problem for triangles. http://www2.stetson.edu/~efriedma/heiltri/. Accessed 7 Sept 2011
De Comité F, Delahaye J-P (2009) Automated proofs in geometry: computing upper bounds for the Heilbronn problem for triangles. http://arxiv.org/abs/0911.4375v3. Accessed 7 Sept 2011
De Comité F, Delahaye J-P (2009b) A counterexample to Kahle-conjecture, new conjectures and automated proofs in geometry. http://www.lifl.fr/~decomite/triangle/triangles.html. Accessed 7 Sept 2011
Kahle M (2008) Points in a triangle forcing small triangles. Geombinatorics XVIII:114–128. http://arxiv.org/abs/0811.2449v1. Accessed 7 Sept 2011
Soifer A (2009) How does one cut a triangle?, 2nd edn. Springer, New York
Tal A (2009) Algorithms for Heilbronn’s triangle problem. MSc thesis. Israel Institute of Technology, Haifa, May 2009. ftp://ftp.cs.technion.ac.il/pub/barequet/theses/tal-a-msc-thesis.pdf.gz. Accessed 7 Sept 2011
Weisstein EW (2011) Heilbronn triangle problem. From MathWorld-A Wolfram Web Resource. http://mathworld.wolfram.com/HeilbronnTriangleProblem.html. Accessed 7 Sept 2011
Yang L, Zhang JZ, Zeng ZB (1994) On the Heilbronn numbers of triangular regions. Acta Math Sinica 37:678–689
Acknowledgments
The authors would like to thank Dr. David Cantrell and Prof. Erich Friedman for their helpful corrections and suggestions, Prof. Peter Serocka and Tuo Leng for polishing English writing. The authors also thank the High Performance Computer Center of East China Normal University for CPU time support. The authors are grateful for the valuable suggestions made by the anonymous referees. The work is supported by Shanghai Municipal Natural Science Foundation (No. 11ZR1411500), Innovation Program of Shanghai Municipal Education Commission (No. 11ZZ37), Shanghai Leading Academic Discipline Project (No. B412), Specialized Research Fund for the Doctoral Program of Higher Education (Nos. 20110076110010, 20110076120015), Fundamental Research Funds for the Central Universities (No. 78210152), National Basic Research Program of China (No. 2011CB302904), and Natural Science Foundation of China (NSFC) (Nos. 61021004, 11071273).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, L., Zeng, Z. & Zhou, W. An upper bound of Heilbronn number for eight points in triangles. J Comb Optim 28, 854–874 (2014). https://doi.org/10.1007/s10878-012-9585-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9585-5