Parallel computation of discrete Voronoi diagrams
From MaRDI portal
Publication:5096154
DOI10.1007/BFb0028984zbMath1492.68134MaRDI QIDQ5096154
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
68W40: Analysis of algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W10: Parallel algorithms in computer science
Related Items
The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs, Parallel computation of distance transforms, Computational geometry algorithms for the systolic screen, A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
Cites Work
- Mesh-Connected Computers with Broadcasting
- Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
- Pyramid computer solutions of the closest pair problem
- Data Movement Techniques for the Pyramid Computer
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
- Triangle cellular automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item