Shortest Path in a Polygon using Sublinear Space.
From MaRDI portal
Publication:5368680
DOI10.4230/LIPIcs.SOCG.2015.111zbMath1378.68172OpenAlexW2294629025MaRDI QIDQ5368680
Publication date: 10 October 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.SOCG.2015.111
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
This page was built for publication: Shortest Path in a Polygon using Sublinear Space.