Reprint of: Memory-constrained algorithms for simple polygons
From MaRDI portal
Publication:390167
DOI10.1016/J.COMGEO.2013.11.004zbMATH OpenNoneOpenAlexW2067317911MaRDI QIDQ390167FDOQ390167
Authors: Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz 
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.11.004
Recommendations
- Memory-constrained algorithms for simple polygons
- Constant-work-space algorithm for a shortest path in a simple polygon
- Constant-work-space algorithms for shortest paths in trees and simple polygons
- Constant-work-space algorithms for geometric problems
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
Cites Work
- Computational Complexity
- Undirected connectivity in log-space
- Computational geometry. Algorithms and applications.
- Data streams: algorithms and applications.
- Triangulating a simple polygon in linear time
- Selection and sorting with limited storage
- Optimal shortest path queries in a simple polygon
- Upper bounds for time-space trade-offs in sorting and selection
- Triangulating a simple polygon
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Constant-work-space algorithms for shortest paths in trees and simple polygons
- Comparison-based time-space lower bounds for selection
- Space-time trade-offs for stack-based algorithms
- Constant-work-space algorithms for geometric problems
- Computing the visibility polygon using few variables
- Triangulation and shape-complexity
- Triangulating Simple Polygons and Equivalent Problems
- Slicing an ear using prune-and-search
- Improved upper bounds for time-space tradeoffs for selection with limited storage
- Towards in-place geometric algorithms and data structures
- Space-efficient planar convex hull algorithms
- Selection from read-only memory and sorting with minimum data movement
- Multi-pass geometric algorithms
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
Cited In (9)
- Extra space during initialization of succinct data structures and dynamical initializable arrays
- Frameworks for designing in-place graph algorithms
- A framework for in-place graph algorithms
- Title not available (Why is that?)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Space efficient linear time algorithms for BFS, DFS and applications
- Optimal In-place Algorithms for Basic Graph Problems
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
- Space-efficient biconnected components and recognition of outerplanar graphs
This page was built for publication: Reprint of: Memory-constrained algorithms for simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390167)
