Pages that link to "Item:Q1108791"
From MaRDI portal
The following pages link to Finding the convex hull of a sorted point set in parallel (Q1108791):
Displaying 14 items.
- Optimal convergence rate of the multitype sticky particle approximation of one-dimensional diagonal hyperbolic systems with monotonic initial data (Q321609) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228) (← links)
- A sublogarithmic convex hull algorithm (Q911280) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- A parallel algorithm for the conductor of a point set (Q1289527) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- Finding the Convex Hull of Discs in Parallel (Q4513213) (← links)
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS (Q4682161) (← links)
- Techniques and Open Questions in Computational Convex Analysis (Q5746453) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)
