Pages that link to "Item:Q4698354"
From MaRDI portal
The following pages link to AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON (Q4698354):
Displaying 5 items.
- Parallel algorithm for segment visibility reporting (Q688184) (← links)
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- A space-time trade-off for computing the visibility polygon in the multi-pass model (Q780246) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- (Q5289053) (← links)