Back to Search
Start Over
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.
- Source :
- International Journal of Foundations of Computer Science; Jun2020, Vol. 31 Issue 04, p421-443, 23p
- Publication Year :
- 2020
-
Abstract
- 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 (n 2) time algorithm to compute such a triangle inside the given convex polygon. [ABSTRACT FROM AUTHOR]
- Subjects :
- ALGORITHMS
TRIANGLES
POLYGONS
COMPUTATIONAL geometry
Subjects
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 31
- Issue :
- 04
- Database :
- Complementary Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 144455291
- Full Text :
- https://doi.org/10.1142/S0129054120500173