# On the modality of convex polygons

Discrete & Computational Geometry, Aug 1990

Under two 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 Aggarwal and Melville.

This is a preview of a remote PDF: https://link.springer.com/content/pdf/10.1007%2FBF02187802.pdf

Karl Abrahamson. On the modality of convex polygons, Discrete & Computational Geometry, 1990, 409-419, DOI: 10.1007/BF02187802