On an empty triangle with the maximum area in planar point sets (Q2275445)

For any given set \(P\) of \(n\) points in general position in the plane, let \(T\subset P\) be a subset of three elements in convex position. The triangle \(\mathrm{conv}\,T\) is said to be \textit{empty} if no point of \(P\) lies inside \(\mathrm{conv}\,T\). The author studies the ratio between the maximum area of an empty triangle and the area of \(\mathrm{conv}P\), i.e., the function \( f(n)=\min_{\#P=n}\max_{T\subset P} A(\mathrm{conv}\,T)/A(\mathrm{conv}P)\). In the previous paper [Lect. Notes Comput. Sci. 3330, 102--107 (2005; Zbl 1117.52009)], the author et al. obtained upper and lower bounds for \(f(n)\) when \(n\geq 25\), namely \(23/\bigl((37+3\sqrt{5})n+c\bigr)\leq f(n)\leq 1/(n-1)\) for a certain constant \(c\). In this paper, the author improves slightly the lower bound to \(15/\bigl((24+2\sqrt{5})n+c\bigr)\) for \(n\geq 17\).