Maximum-area triangle in a convex polygon, revisited

DOI10.1016/j.ipl.2020.105943zbMath1441.68272arXiv1705.11035OpenAlexW2617996878MaRDI QIDQ783698

Ivor van der Hoog, Jérôme Urhausen, Maarten Löffler, Vahideh Keikha, Ali Mohades

Publication date: 4 August 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.11035

zbMATH Keywords

convex polygoncomputational geometrylargest 4-gonlargest triangle

Mathematics Subject Classification ID

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

Related Items

Finding a largest-area triangle in a terrain in near-linear time ⋮ An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ On rainbow quadrilaterals in colored point sets ⋮ Optimal Embedded and Enclosing Isosceles Triangles ⋮ Largest triangle inside a terrain

Cites Work

• On the multimodality of distances in convex polygons
• Finding Extremal Polygons
• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES