Geometric k Shortest Paths
From MaRDI portal
Publication:5363016
Recommendations
- scientific article; zbMATH DE number 1424303
- Approximation algorithms for geometric shortest path problems
- Shortest-Path Queries in Geometric Networks
- Finding Shortest Paths With Computational Geometry
- Approximating geometric bottleneck shortest paths
- scientific article; zbMATH DE number 1962800
- Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
- Efficient computation of geodesic shortest paths
- Searching shortest paths on a set of geometric objects
- scientific article; zbMATH DE number 1302178
Cited in
(14)- Drawing Shortest Paths in Geodetic Graphs
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
- Approximation algorithms for geometric shortest path problems
- k-pairs non-crossing shortest paths in a simple polygon
- Shortest paths in the plane with obstacle violations
- Fundamentals of Computation Theory
- Drawing Shortest Paths in Geodetic Graphs
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- scientific article; zbMATH DE number 1305420 (Why is no real title available?)
- Quickest visibility queries in polygonal domains
- Shortest paths in the plane with obstacle violations
- k-th shortest collision-free path planning
- Efficient computation of geodesic shortest paths
- Shortest path geometric rounding
This page was built for publication: Geometric k Shortest Paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363016)