Pages that link to "Item:Q2391542"

The following pages link to Memory-constrained algorithms for simple polygons (Q2391542):

Displaying 18 items.

• Space-time trade-offs for stack-based algorithms (Q494797) (← links)
• Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
• Simplified linear-time Jordan sorting and polygon clipping (Q911762) (← links)
• An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
• Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
• A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
• Rectilinear path problems in restricted memory setup (Q2357163) (← links)
• A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
• Constant-work-space algorithms for shortest paths in trees and simple polygons (Q2865044) (← links)
• Space-Time Trade-offs for Stack-Based Algorithms (Q2957891) (← links)
• Shortest path in a polygon using sublinear space (Q2970464) (← links)
• Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)
• Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
• (Q4473923) (← links)
• A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon (Q4640339) (← links)
• Priority Queues and Sorting for Read-Only Data (Q4922111) (← links)
• A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q5136282) (← links)
• Experimental study of compressed stack algorithms in limited memory environments (Q5140731) (← links)