Pages that link to "Item:Q1104089"
From MaRDI portal
The following pages link to Parallel algorithms for shortest path problems in polygons (Q1104089):
Displaying 7 items.
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Parallel mesh algorithms for grid graph shortest paths with application to separation of touching chromosomes (Q1386454) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Accelerated parallel projection method for solving the shortest distance problem (Q2907419) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- (Q5289053) (← links)