scientific article
From MaRDI portal
Publication:2968076
zbMath1404.68182MaRDI QIDQ2968076
Yajun Wang, Wolfgang Mulzer, Günter Rote, Tetsuo Asano
Publication date: 9 March 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Time-space trade-offs for triangulations and Voronoi diagrams ⋮ Optimal In-place Algorithms for Basic Graph Problems ⋮ Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ Memory-constrained algorithms for simple polygons ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ A new balanced subdivision of a simple polygon for time-space trade-off algorithms ⋮ Computing a visibility polygon using few variables ⋮ Constant work-space algorithms for facility location problems ⋮ Prune-and-search with limited workspace ⋮ Space-efficient biconnected components and recognition of outerplanar graphs ⋮ Space-time trade-offs for stack-based algorithms ⋮ A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Improved Space Efficient Algorithms for BFS, DFS and Applications ⋮ Unnamed Item ⋮ Space efficient linear time algorithms for BFS, DFS and applications ⋮ Rectilinear path problems in restricted memory setup
