Abstract
In this paper, we show lower bounds for the on-line version of Heilbronn's triangle problem in three and four dimensions. Specifically, we provide incremental constructions for positioning n points in the 3-dimensional (resp., 4-dimensional) unit cube, for which every tetrahedron (resp., pentahedron) defined by four (resp., five) of these points has volume Ω(1/n 3.333…) (resp., Ω(1/n 5.292…) ).
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.
