Pages that link to "Item:Q1105374"
From MaRDI portal
The following pages link to Parallel algorithms for some functions of two convex polygons (Q1105374):
Displaying 23 items.
- Comments on two parallel algorithms for the planar convex hull problem (Q579833) (← 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)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Finding congruent regions in parallel (Q1195148) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← links)
- A parallel algorithm for finding congruent regions (Q1262793) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- A parallel algorithm for computing polygon set operations (Q1892866) (← links)
- Convexity problems on meshes with multiple broadcasting (Q1898223) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Parallel algorithm for corner finding on digital curves (Q3804230) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- Finding the Convex Hull of Discs in Parallel (Q4513213) (← links)
- Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace (Q4629982) (← links)
- CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS (Q4682156) (← links)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS (Q4819957) (← links)
- An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search (Q6102330) (← links)