The following pages link to Parallel computational geometry (Q1115600):
Displaying 50 items.
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Data parallel geometric operations on lists (Q673934) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Optimal parallel quicksort on EREW PRAM (Q751287) (← links)
- A sublogarithmic convex hull algorithm (Q911280) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- Parallel algorithms for the segment dragging problem (Q918740) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- Parallel geometric algorithms for multi-core computers (Q991179) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Parallel algorithms for some functions of two convex polygons (Q1105374) (← links)
- An O(log n) time parallel algorithm for triangulating a set of points in the plane (Q1107999) (← links)
- Parallel computational geometry (Q1115600) (← links)
- An efficient VLSI architecture with applications to geometric problems (Q1124264) (← links)
- Parallel construction of subdivision hierarchies (Q1124347) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Parallel computational geometry of rectangles (Q1187198) (← links)
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers (Q1187199) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Line-segment intersection reporting in parallel (Q1193518) (← links)
- Parallel fractional cascading on hypercube multiprocessors (Q1196294) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← links)
- Scaleable parallel algorithms for lower envelopes with applications (Q1273879) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Parallel geometric algorithms on a mesh-connected computer (Q1825643) (← links)
- Robust algorithms for constructing strongly convex hulls in parallel. (Q1853528) (← links)
- \(O(\log \log n)\)-time integer geometry on the CRCW PRAM (Q1894712) (← 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 algorithms for arrangements (Q1907232) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Designing checkers for programs that run in parallel (Q1911462) (← links)
- On the multisearching problem for hypercubes (Q1917039) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching (Q2127711) (← links)
- New sequential and parallel algorithms for computing the \(\beta\)-spectrum (Q2348036) (← links)
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram (Q2367127) (← links)
- Load-Balancing for Parallel Delaunay Triangulations (Q3297568) (← links)
