A vertex of a simple polygon \(P\) is said to be unimodal if the Euclidean distance function to the other vertices of \(P\) is unimodal. The author defines three very special classes of convex polygons with the following hierarchy: Semi-circle \(\subset\) weakly semicircle \(\subset\) barn-shaped. All vertices of a semi-circle polygon are unimodal. Weakly semi-circle polygons must have two unimodal vertices but not more than two, and barn- shaped polygons must have one unimodal vertex but not more. All proves are very elementary.
Recommendations
Cites work
- A simple linear-time algorithm for computing the ring and MST of unimodal polygons
- Complexity, convexity, and unimodality
- Fast computation of the modality of polygons
- scientific article; zbMATH DE number 3902440 (Why is no real title available?)
- scientific article; zbMATH DE number 193423 (Why is no real title available?)
- On the multimodality of distances in convex polygons
- On the unimodality of convex polygons
Cited in
(5)
This page was built for publication: The morphology of convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205915)