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):
Displaying 13 items.
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- Planar separators and parallel polygon triangulation. (Q960516) (← 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)
- Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons (Q1615773) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- On the multisearching problem for hypercubes (Q1917039) (← links)
- Intelligent computing systems with actors -- parallel dynamic programming algorithm of the polygon triangulation problem (Q2784637) (← links)
- Quadrilaterizing an Orthogonal Polygon in Parallel (Q4379627) (← 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)
- Triangulating a polygon in parallel (Q4732108) (← links)