Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon

DOI10.1142/S0129054120500173zbMath1462.68209MaRDI QIDQ5859625

Suchismita Roy, Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

algorithmcomputational geometryoptimal inclusion problemproperties of isosceles and equilateral triangles

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Finding the largest area axis-parallel rectangle in a polygon
• Exact algorithms for the max-min dispersion problem
• Finding largest rectangles in convex polygons
• Geometric applications of a matrix-searching algorithm
• An algorithm for generalized point location and its applications
• Powers of tensors and fast matrix multiplication
• Finding large sticks and potatoes in polygons
• Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model

This page was built for publication: Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon