On the modality of convex polygons

DOI10.1007/BF02187802zbMath0712.52006MaRDI QIDQ748888

D. Kharzeev

Publication date: 1990

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131129

zbMATH Keywords

modalityrandom convex polygon

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (2)

An optimal algorithm for realizing a Delaunay triangulation ⋮ Generating random polygons with given vertices

Cites Work

• Unnamed Item
• Geometric applications of a matrix-searching algorithm
• On the multimodality of distances in convex polygons
• Complexity, convexity, and unimodality
• Fast computation of the modality of polygons
• Sur L'enveloppe convexe des nuages de points aleatoires dans Rⁿ. I

This page was built for publication: On the modality of convex polygons