A lower bound for Hellbronn's triangle problem in d dimensions

Authors:
Gill Barequet
Affiliations:
Faculty of Computer Science, The Technion-IIT, Haifa 32000, Israel and Center for Geometric Computing, Dept. of Computer Science, Johns Hopkins University, Baltimore, MD
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 1
Cited 3

Efficiently approximating the minimum-volume bounding box of a point set in three dimensions

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

On Heilbronn's problem in higher dimension

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
The Incompressibility Method

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract