Triangulating a simple polygon in linear time (Q1176324)

The author gives an optimal linear time algorithm for triangulating on \(n\)-vertex simple polygon, thus a longstanding and basic open problem is settled. The underlying quite clear and intuitive ideas rely on the balanced divide and conquer, polygon cutting theorem and the plane separator theorem. However the full understanding of all details is a non-trivial task. In my opinion the step by step implementation is almost impossible in the present state of the algorithm.