Geometric k Shortest Paths

DOI10.1137/1.9781611973730.107zbMath1371.68292OpenAlexW4246087575WikidataQ122277777 ScholiaQ122277777MaRDI QIDQ5363016

Kevin Verbeek, Sylvester Eriksson-Bique, Topi Talvitie, Bettina Speckmann, Hakan Yildiz, Valentin Polishchuk, Subhash Suri, J. E. Hershberger

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973730.107

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time ⋮ Shortest paths in the plane with obstacle violations ⋮ Unnamed Item ⋮ Quickest visibility queries in polygonal domains

This page was built for publication: Geometric k Shortest Paths