Parallel geometric algorithms on a mesh-connected computer

DOI10.1007/BF01840383zbMath0684.68042MaRDI QIDQ1825643

Yanyan Li

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsVoronoi diagramcomputational geometrymesh-connected computermultipoint location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Algorithms in computer science (68W99) Polytopes and polyhedra (52Bxx)

Related Items (5)

An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram ⋮ AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗ ⋮ Voronoi-like partition of lattice in cellular automata ⋮ Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms ⋮ On the parallel-decomposability of geometric problems

Cites Work

• Parallel computational geometry
• Voronoi diagrams from convex hulls
• An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
• Graph Problems on a Mesh-Connected Processor Array
• An optimal routing algorithm for mesh-connected Parallel computers
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• A Self-Routing Benes Network and Parallel Permutation Algorithms
• Sorting on a mesh-connected parallel computer
• Bitonic Sort on a Mesh-Connected Parallel Computer

This page was built for publication: Parallel geometric algorithms on a mesh-connected computer