An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s up to n. The algorithm runs in O(n^2/s+n(log s)log^5(n/s)) expected time using O(s) variables, for any s up to n. In particular, the algorithm runs in O(n^2/s) expected time for most values of s.
['Boris Aronov', 'Matias Korman', 'Simon Pratt', 'André van Renssen', 'Marcel Roeloffzen']
Time-Space Trade-offs for Triangulating a Simple Polygon