Pages that link to "Item:Q5745387"
From MaRDI portal
The following pages link to Time-space trade-offs for triangulating a simple polygon (Q5745387):
Displaying 7 items.
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
- Space-Time Trade-offs for Stack-Based Algorithms (Q2957891) (← links)
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3777450) (← 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)