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
β¦ LIBER β¦
Triangles in arrangements of lines
β Scribed by Thomas O Strommer
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 325 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Triangles in arrangements of lines
β
G.B. Purdy
π
Article
π
1979
π
Elsevier Science
π
English
β 486 KB
Arrangements of lines and pseudolines wi
β
Dragoslav LjubiΔ; Jean-Pierre Roudneff; Bernd Sturmfels
π
Article
π
1989
π
Elsevier Science
π
English
β 421 KB
On Envelopes of Arrangements of Lines
β
D. Eu; E. GuΓ©vremont; G.T. Toussaint
π
Article
π
1996
π
Elsevier Science
π
English
β 436 KB
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
On disjoint concave chains in arrangemen
β
Dan Halperin; Micha Sharir
π
Article
π
1991
π
Elsevier Science
π
English
β 557 KB
On disjoint concave chains in arrangemen
β
Dan Halperin; Micha Sharir
π
Article
π
1994
π
Elsevier Science
π
English
β 351 KB
On the number of triangles in simple arr
β
Jean-Pierre Roudneff
π
Article
π
1986
π
Elsevier Science
π
English
β 445 KB