SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS

DOI10.1142/S0218195996000241zbMath0859.68115OpenAlexW2121653690MaRDI QIDQ5687655

Frank Dehne, Andrew Rau-Chaplin, Andreas Fabri

Publication date: 16 December 1996

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195996000241

zbMATH Keywords

coarse grained multicomputer modelscalable parallel computational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Parallel skyline queries ⋮ Solving large FPT problems on coarse-grained parallel machines ⋮ A coarse-grained multicomputer algorithm for the detection of repetitions ⋮ The deterministic complexity of parallel multisearch ⋮ Efficient parallel graph algorithms for coarse grained multicomputers and BSP ⋮ Coarse Grained Parallel Selection ⋮ 1-optimality of static BSP computations: Scheduling independent chains as a case study. ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ Graph coloring on coarse grained multicomputers ⋮ Randomized parallel list ranking for distributed memory multiprocessors. ⋮ A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions ⋮ Sorting signed permutations by reversals, revisited ⋮ Algorithms for maximum independent set in convex bipartite graphs ⋮ Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model ⋮ Algorithm 947