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.
Cite
CITATION STYLE
Ahn, H. K., Baraldo, N., Oh, E., & Silvestri, F. (2017). A time-space trade-off for triangulations of points in the plane. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10392 LNCS, pp. 3–12). Springer Verlag. https://doi.org/10.1007/978-3-319-62389-4_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
