Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem
From MaRDI portal
Publication:2921413
DOI10.1007/978-3-662-44777-2_24zbMath1423.68543OpenAlexW2105448807MaRDI QIDQ2921413
Publication date: 8 October 2014
Published in: Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_24
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (15)
Time-space trade-offs for triangulations and Voronoi diagrams ⋮ Optimal In-place Algorithms for Basic Graph Problems ⋮ Strictly in-place algorithms for permuting and inverting permutations ⋮ Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ 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 maximum cardinality search, its applications, and variants of BFS ⋮ Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Space-efficient algorithms for longest increasing subsequence ⋮ Improved Space Efficient Algorithms for BFS, DFS and Applications ⋮ Simple 2^f-Color Choice Dictionaries ⋮ Space efficient linear time algorithms for BFS, DFS and applications
This page was built for publication: Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem
