Pages that link to "Item:Q1104087"
From MaRDI portal
The following pages link to Parallel triangulation of a polygon in two calls to the trapezoidal map (Q1104087):
Displayed 8 items.
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- On the multisearching problem for hypercubes (Q1917039) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS (Q4513236) (← links)