Publication:5140731
From MaRDI portal
DOI10.4230/LIPIcs.SEA.2018.19zbMath1493.68128arXiv1706.04708MaRDI QIDQ5140731
Yago Diez, Jean-François Baffier, Matias Korman
Publication date: 16 December 2020
Full work available at URL: https://arxiv.org/abs/1706.04708
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing a visibility polygon using few variables
- Space-time trade-offs for stack-based algorithms
- Memory-constrained algorithms for simple polygons
- Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
- On finding the convex hull of a simple polygon
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams
- Time-space trade-offs for triangulating a simple polygon