Given simple polygon we have to find maximum area of smallest triangle in all possible triangulations.
I was trying to solve it by generating all possible triangulations, but for complex polygon it turned out to have number of triangulations equal to catalan(n).
Number of verticles is very small, but too big for factorial complexity.
Are there any other propeteries of triangulations and given above maximum "smallest" triangle?
Chris