On the unimodality of convex polygons

DOI10.1016/0020-0190(88)90226-8zbMath0662.52001OpenAlexW2006930154MaRDI QIDQ1113454

Stephan Olariu

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90226-8

zbMATH Keywords

convex polygoncomputational geometryunimodality

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (3)

Constructing bimodal convex hexagons ⋮ A simple linear-time algorithm for computing the ring and MST of unimodal polygons ⋮ The morphology of convex polygons

Cites Work

• On the multimodality of distances in convex polygons
• Complexity, convexity, and unimodality
• Fast computation of the modality of polygons
• A Counterexample to a Diameter Algorithm for Convex Polygons

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