Parallel geometric algorithms on a mesh-connected computer
From MaRDI portal
DOI10.1007/BF01840383zbMATH Open0684.68042MaRDI QIDQ1825643FDOQ1825643
Authors: Yanyan Li 
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx) Algorithms in computer science (68W99)
Cites Work
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Voronoi diagrams from convex hulls
- A Self-Routing Benes Network and Parallel Permutation Algorithms
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Graph Problems on a Mesh-Connected Processor Array
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
- Sorting on a mesh-connected parallel computer
- Parallel computational geometry
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
- An optimal routing algorithm for mesh-connected Parallel computers
Cited In (15)
- Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms
- Dynamic computational geometry on meshes and hypercubes
- Simulating parallel neighboring communications among square meshes and square toruses
- On the parallel-decomposability of geometric problems
- AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗
- An efficient VLSI architecture with applications to geometric problems
- An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer
- Triangulation on reconfigurable meshes: A natural decomposition approach
- Voronoi-like partition of lattice in cellular automata
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
- Title not available (Why is that?)
- Efficiently parallelised algorithm to find isoptic surface of polyhedral meshes
- Title not available (Why is that?)
- Recursion and parallel algorithms in geometric modeling problems
- A parallel algorithm for volume projections on SIMD mesh-connected computers
This page was built for publication: Parallel geometric algorithms on a mesh-connected computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825643)
