Given a convex polygon P with n vertices, we show that all the maximal area triangles in P can be computed ] in linear time . This settles the problem proposed by Keikha et. al. .
In arXiv 1705.11035], the widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect by Keikha et. al., and whether it can still be solved in linear time was proposed as an open problem. We resolved it affirmatively by presenting a new linear time algorithm. Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles .
R
Given a convex polygon P with n vertices, we show that all the maximal area triangles in P can be computed
In
A
arXiv 1705.11035
A
, the widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect by Keikha et. al., and whether it can still be solved
R
. This settles the problem proposed by Keikha et. al.
was proposed as an open problem. We resolved it affirmatively by presenting a new linear time algorithm. Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles