Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Shortest Path in a Polygon using Sublinear Space.

From MaRDI portal
Publication:5368680
Jump to:navigation, search

DOI10.4230/LIPIcs.SOCG.2015.111zbMath1378.68172OpenAlexW2294629025MaRDI QIDQ5368680

Sariel Har-Peled

Publication date: 10 October 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.SOCG.2015.111


zbMATH Keywords

shortest pathviolator spaceslimited space


Mathematics Subject Classification ID

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.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5368680&oldid=20079165"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 9 February 2024, at 00:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki