Abstract
AbstractThe Heilbronn triangle problem is a classical geometrical problem that asks for a placement of points in the unit square that maximizes the smallest area of a triangle formed by three of those points. This problem has natural generalizations. For an integer and a set of points in , let be the minimum area of the convex hull of points in . Here, instead of considering the supremum of over all such choices of , we consider its average value, , when the points in are chosen independently and uniformly at random in . We prove that , for every fixed .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
