Pages that link to "Item:Q2366233"
From MaRDI portal
The following pages link to An addendum to parallel methods for visibility and shortest-path problems in simple polygons (Q2366233):
Displaying 6 items.
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON (Q4698354) (← links)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
- (Q5289053) (← links)