A time-space trade-off for triangulations of points in the plane

DOI10.1007/978-3-319-62389-4_1zbMath1434.68745OpenAlexW2729633485MaRDI QIDQ2412397

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

Publication date: 23 October 2017

Full work available at URL: http://hdl.handle.net/11577/3228399

Mathematics Subject Classification ID

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

Related Items (4)

Space-Efficient Algorithms for Longest Increasing Subsequence ⋮ A new balanced subdivision of a simple polygon for time-space trade-off algorithms ⋮ Space-efficient algorithms for longest increasing subsequence ⋮ Unnamed Item

This page was built for publication: A time-space trade-off for triangulations of points in the plane