Polygons in Arrangements Generated by n Points.
Abstract
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1972
- Accession Number
- AD0751686
Entities
People
- Branko Gruenbaum
Organizations
- University of Washington