Abstract
Arrangements of lines in the plane and algorithms for computing extreme features of arrangements are a major topic in computational geometry. Theoretical bounds on the size of these features are also of great interest. Heilbronn’s triangle problem is one of the famous problems in discrete geometry. In this paper we show a duality between extreme (small) face problems in line arrangements (bounded in the unit square) and Heilbronn-type problems. We obtain lower and upper combinatorial bounds (some are tight) for some of these problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons, 1992
Barequet, G.: A lower bound for Heilbronn’s triangle problem in d dimensions. Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms. Baltimore, MD, 76–81, January 1999
Komlós, J., Pintz, J., Szemerédi, E.: On Heilbronn’s triangle problem. J. London Mathematical Society (2) 24 (1981) 385–396
Komlós, J., Pintz, J., Szemerédi, E.: A lower bound for Heilbronn’s problem. J. London Mathematical Society (2) 25 (1982) 13–24
Mitchell, J.S.B.: On the existence of small faces in arrangements of lines. Manuscript, Dept. of Applied Mathematics, SUNY Stony Brook, NY, 1995. (available at http://www.ams.sunysb.edu/~jsbm/publications.html)
Roth, K.F.: On a problem of Heilbronn. Proc. London Mathematical Society 26 (1951) 198–204
Roth, K.F.: On a problem of Heilbronn, II. Proc. London Mathematical Society (3) 25 (1972) 193–212
Roth, K.F.: On a problem of Heilbronn, III. Proc. London Mathematical Society (3) 25 (1972) 543–549
Schmidt, W.M.: On a problem of Heilbronn. J. London Mathematical Society (2) 4 (1971) 545–550
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barequet, G. (2000). A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_5
Download citation
DOI: https://doi.org/10.1007/3-540-44968-X_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67787-1
Online ISBN: 978-3-540-44968-3
eBook Packages: Springer Book Archive