Triangles in Euclidean arrangements

Citation
S. Felsner et K. Kriegel, Triangles in Euclidean arrangements, DISC COM G, 22(3), 1999, pp. 429-438
Citations number
19
Categorie Soggetti
Engineering Mathematics
Journal title
DISCRETE & COMPUTATIONAL GEOMETRY
ISSN journal
01795376 → ACNP
Volume
22
Issue
3
Year of publication
1999
Pages
429 - 438
Database
ISI
SICI code
0179-5376(199910)22:3<429:TIEA>2.0.ZU;2-K
Abstract
The number of triangles in arrangements of lines and pseudolines has been t he object of some research. Most results, however, concern arrangements in the projective plane. In this article we add results for the number of tria ngles in Euclidean arrangements of pseudolines. Though the change in the em bedding space from projective to Euclidean may seem small there are interes ting changes both in the results and in the techniques required for the pro ofs. In 1926 Levi proved that a nontrivial arrangement-simple or not-of n pseudo lines in the projective plane contains at least n triangles. To show the co rresponding result for the Euclidean plane, namely, that a simple arrangeme nt of n pseudolines contains at least n - 2 triangles, we had to find a com pletely different proof. On the other hand a nonsimple arrangement of n pse udolines in the Euclidean plane can have as few as 2n/3 triangles and this bound is best possible. We also discuss the maximal possible number of tria ngles and some extensions.