The following pages link to Multi-pass geometric algorithms (Q866973):
Displaying 20 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- A space-time trade-off for computing the visibility polygon in the multi-pass model (Q780246) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)
- (Q3201638) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- (Q3305368) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- (Q5091039) (← links)
