Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
From MaRDI portal
Publication:2842143
DOI10.1007/978-3-642-40104-6_6zbMath1390.68328OpenAlexW2106424477MaRDI QIDQ2842143
Tetsuo Asano, David G. Kirkpatrick
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40104-6_6
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (11)
Time-space trade-offs for triangulations and Voronoi diagrams ⋮ Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ Space efficient data structures for nearest larger neighbor ⋮ Simultaneous encodings for range and next/previous larger/smaller value queries ⋮ Encoding Nearest Larger Values ⋮ Depth-First Search Using $$O(n)$$ Bits ⋮ Space Efficient Data Structures for Nearest Larger Neighbor ⋮ A new balanced subdivision of a simple polygon for time-space trade-off algorithms ⋮ Encoding nearest larger values ⋮ A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon ⋮ Unnamed Item
This page was built for publication: Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
