Given a finite collection L of lines in the hyperbolic plane H, we denote by k = k(L) its Karzanov number, i.e., the maximal number of pairwise intersecting lines in L, and by C(L) and n = n(L) the set and the number, respectively, of those points at infinity that are incident with at least one line
On representing contexts in line arrangements
✍ Scribed by Jürgen Bokowski; Wolfgang Kollewe
- Publisher
- Springer Netherlands
- Year
- 1992
- Tongue
- English
- Weight
- 581 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The envelope of an arrangement of lines is the polygon consisting of the finite length segments that bound the infinite faces of the arrangement. We study the Ž geometry of envelope polygons simple polygons that are the envelope of some . arrangement . We show that envelope polygons are L-convex and
A set of n nonconcurrent lines in the projective plane (called an arrangement) divides the plane into polygonal cells. It has long been a problem to find a nontrivial upper bound on the number of triangular regions. We show that &n(n -1) is such a bound. We also show that if no three lines are concu