Constructing bimodal convex hexagons
Stephan Olariu · International Journal of Computer Mathematics · 1990
A simple polygon P is said to be unimodal if for every vertex of P, the Euclidean distance function to the other vertices of P is unimodal. The study of unimodal polygons has emerged as a fruitful area of computational and discrete geometry. We give a simple construction for a large class of hexagons none of whose vertices is unimodal.