Polygons in Arrangements Generated by n Points.
WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS
Pagination or Media Count:
Generalizing a result of Sklyarskii-Cencov-Yaglom concerning partitions of a convex polygon by its diagonals, the following theorem is established If F is a polygonal face of the arrangement generated in the plane by m points, then the number of sides of F is at most m if m is odd, and at most m-1 if m is even both bounds are best possible. Author
- Theoretical Mathematics