47 citations · 60 across the 9 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CG2018
Rectilinear Shortest Paths Among Transient Obstacles
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
This paper presents an optimal algorithm for determining time-minimal rectilinear paths among transient rectilinear obstacles. An obstacle is transient if it exis…
cs.DS2018
Time-Dependent Shortest Path Queries Among Growing Discs
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
The determination of time-dependent collision-free shortest paths has received a fair amount of attention. Here, we study the problem of computing a time-dependent shortest path am…
cs.DS2018★ 1 cited
Query Shortest Paths Amidst Growing Discs
Arash Nouri, Jorg-Rudiger Sack
The determination of collision-free shortest paths among growing discs has previously been studied for discs with fixed growing rates. Here, we study a more general case of this pr…