Pages that link to "Item:Q1187196"
From MaRDI portal
The following pages link to Optimal parallel algorithms for point-set and polygon problems (Q1187196):
Displaying 20 items.
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- A sublogarithmic convex hull algorithm (Q911280) (← links)
- An optimal parallel algorithm for triangulating a set of points in the plane (Q1100899) (← links)
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
- A parallel algorithm for the conductor of a point set (Q1289527) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- A parallel algorithm for approximate regularity. (Q1607140) (← links)
- An optimal parallel algorithm for solving the maximal elements problem in the plane (Q1822975) (← links)
- A parallel algorithm for computing polygon set operations (Q1892866) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- New sequential and parallel algorithms for computing the \(\beta\)-spectrum (Q2348036) (← links)
- (Q2984827) (← links)
- (Q4474217) (← links)
- Finding the Convex Hull of Discs in Parallel (Q4513213) (← links)
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
- CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS (Q4682156) (← links)
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
