A Time-Space Trade-Off for Triangulations of Points in the Plane

Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri

Abstract: In this paper, we consider time-space trade-offs for reporting a triangulation of points in the plane. The goal is to minimize the amount of working space while keeping the total running time small. We present the first multi-pass algorithm on the problem that returns the edges of a triangulation with their adjacency information. This even improves the previously best known random-access algorithm.