Technical Reports

The ICICS/CS Reading Room


UBC CS TR-87-25 Summary

On the Modality of Convex Polygons, June 1987 Karl Abrahamson

Under two reasonable definitions of random convex polygons, the expected modality of a random convex polygon grows without bound as the number of vertices grows. This refutes a conjecture of Aggarwall and Melville.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.