Time-space trade-offs for triangulations and Voronoi diagrams

\u3cp\u3eLet S be a planar n-point set. A triangulation for S is a maximal plane straight-line graph with vertex set S. The Voronoi diagram for S is the subdivision of the plane into cells such that each cell has the same nearest neighbors in S. Classically, both structures can be computed in O(n log n) time and O(n) space. We study the situation when the available workspace is limited: given a parameter s ∈ {1,..., n}, an s-workspace algorithm has read-only access to an input array with the points from S in arbitrary order, and it may use only O(s) additional words of Θ(log n) bits for reading and writing intermediate data. The output should then be written to a write-only structure. We describe a deterministic s-workspace algorithm for computing a triangulation of S in time O(n\u3csup\u3e2\u3c/sup\u3e/s + n log n log s) and a randomized s-workspace algorithm for finding the Voronoi diagram of S in expected time O((n\u3csup\u3e2\u3c/sup\u3e/s) log s + n log s log\u3csup\u3e∗\u3c/sup\u3e s).\u3c/p\u3