Improved Time-Space Trade-offs for Computing Voronoi Diagrams

DOI10.20382/jocg.v9i1a6zbMath1418.68224arXiv1708.00814OpenAlexW4297571575MaRDI QIDQ4626292

Yannik Stein, Bahareh Banyassady, André van Renssen, Wolfgang Mulzer, Paul Seiferth, Marcel Roeloffzen, Matias Korman

Publication date: 27 February 2019

Full work available at URL: https://arxiv.org/abs/1708.00814

zbMATH Keywords

Voronoi diagramtime-space trade-offmemory-constrained model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Space-Efficient Algorithms for Longest Increasing Subsequence ⋮ Space-efficient algorithms for longest increasing subsequence

This page was built for publication: Improved Time-Space Trade-offs for Computing Voronoi Diagrams