Arrangements of lines with tree resolutions
β Scribed by Tammo tom Dieck; Ted Petrie
- Book ID
- 112497302
- Publisher
- Springer
- Year
- 1991
- Tongue
- English
- Weight
- 296 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0003-889X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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