We give a deterministic algorithm for triangulating a simple polygon of n vertices in O(n log n) time.
