Abstract
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.
Article PDF
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Avoid common mistakes on your manuscript.
References
A. Aggarwal, M. Klawe, S. Moran, D. Shor, and R. Wilber. Geometric applications of a matrix searching algorithm. InProc. 2nd ACM Symposium on Computational Geometry, pp. 285–292, 1986.
A. Aggarwal and R. C. Melville. Fast computation of the modality of polygons.J. Algorithms,7:369–381, 1986.
D. Avis, G. T. Toussaint, and B. K. Bhattacharya. On the multimodality of distance in convex polygons.Comput. Math. Appl.,8(2):153–156, 1982.
D. P. Dobkin and L. Snyder. On a general method for maximizing and minimizing among geometric problems. InProc. 20th Annual Symposium on Foundations of Computer Science, pp. 7–19, 1979.
F. P. Preparata and M. I. Shamos.Computational Geometry. Springer-Verlag, New York, 1985.
H. Raynaud, Sur l'enveloppe convexe des nuages des points aléatoires dansR n.J. Appl. Probab.,7:35–58, 1970.
W. E. Snyder and D. A. Tang. Finding the extrema of a region.IEEE Trans. Pattern Anal. Mach. Intell.,2:266–269, 1980.
G. T. Toussaint. Complexity, convexity, and unimodality.Internat. J. Comput. Inform. Sci.,13(3):197–217, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Abrahamson, K. On the modality of convex polygons. Discrete Comput Geom 5, 409–419 (1990). https://doi.org/10.1007/BF02187802
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187802