Pages that link to "Item:Q4732108"
From MaRDI portal
The following pages link to Triangulating a polygon in parallel (Q4732108):
Displaying 19 items.
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- Planar separators and parallel polygon triangulation. (Q960516) (← links)
- Parallel triangulation of a polygon in two calls to the trapezoidal map (Q1104087) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Finding congruent regions in parallel (Q1195148) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Rectangulating rectilinear polygons in parallel (Q1391823) (← links)
- Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons (Q1615773) (← links)
- A parallel algorithm for computing polygon set operations (Q1892866) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← 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)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
- Parallel algorithms for all minimum link paths and link center problems (Q5056133) (← links)
- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs (Q5060111) (← links)
- Guarding a Polygon Without Losing Touch (Q5100952) (← links)
- Rectangulating rectilinear polygons in parallel (Q6064015) (← links)
