Multi-pass geometric algorithms
From MaRDI portal
Publication:866973
DOI10.1007/s00454-006-1275-6zbMath1106.68111OpenAlexW2001552595MaRDI QIDQ866973
Publication date: 14 February 2007
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-006-1275-6
Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (19)
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 ⋮ Unnamed Item ⋮ Memory-constrained algorithms for simple polygons ⋮ Space-Efficient Algorithms for Longest Increasing Subsequence ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ Computing a visibility polygon using few variables ⋮ Constant work-space algorithms for facility location problems ⋮ Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon ⋮ Prune-and-search with limited workspace ⋮ Space-time trade-offs for stack-based algorithms ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Space-efficient algorithms for longest increasing subsequence ⋮ A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon ⋮ Unnamed Item ⋮ A space-time trade-off for computing the visibility polygon in the multi-pass model ⋮ On constant factors in comparison-based geometric algorithms and data structures
This page was built for publication: Multi-pass geometric algorithms
