Shortest Path in a Polygon using Sublinear Space.
From MaRDI portal
Publication:5368680
DOI10.4230/LIPICS.SOCG.2015.111zbMATH Open1378.68172OpenAlexW2294629025MaRDI QIDQ5368680FDOQ5368680
Authors: Sariel Har-Peled 
Publication date: 10 October 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.SOCG.2015.111
Recommendations
- Shortest path in a polygon using sublinear space
- Shortest polygonal paths in space
- Optimal shortest path queries in a simple polygon
- Shortest Path Queries in Polygonal Domains
- On Shortest Paths in Polyhedral Spaces
- Approximate shortest paths in simple polyhedra
- Time and space efficient algorithms for shortest paths between convex polygons
- scientific article; zbMATH DE number 7650244
- Shortest paths in the plane with polygonal obstacles
- Shortest paths in simple polygons with polygon-meet constraints
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (7)
- Time and space efficient algorithms for shortest paths between convex polygons
- Optimal shortest path queries in a simple polygon
- Approximate Shortest Paths in Polygons with Violations
- Shortest paths in simple polygons with polygon-meet constraints
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
- Finding a shortest Hamiltonian path inside a simple polygon
This page was built for publication: Shortest Path in a Polygon using Sublinear Space.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368680)
