Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon
International Journal of Foundations of Computer Science
Given a convex polygon with n vertices, we study the problem of identifying a triangle with its smallest side as large as possible among all the triangles that can be drawn inside the polygon. We show that at least one of the vertices of such a triangle must coincide with a vertex of the polygon. We also propose an O(n2) time algorithm to compute such a triangle inside the given convex polygon.
Sadhu, Sanjib; Roy, Sasanka; Nandi, Soumen; Nandy, Subhas C.; and Roy, Suchismita, "Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon" (2020). Journal Articles. 256.