Pages that link to "Item:Q1201749"
From MaRDI portal
The following pages link to Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749):
Displaying 8 items.
- Solving visibility and separability problems on a mesh-of-processors (Q1104081) (← links)
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- An addendum to parallel methods for visibility and shortest-path problems in simple polygons (Q2366233) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON (Q4698354) (← links)
- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers (Q5060120) (← links)
- Minimizing Distance-to-Sight in Polygonal Domains (Q5091052) (← links)
- (Q5289053) (← links)