Voronoi-diagram based heuristics for the location of mobile and unreliable service providers
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
| Hi-index | 0.00 |
This paper describes several parallel algorithms that solve geometric problems. The algorithms are based on a vector model of computation---the {\it scan-model}. The purpose of this paper is both to show how the model can be used and to show a set of interesting algorithms, most of which have been implemented on the Connection Machine, a highly parallel single instruction multiple data (SIMD) computer.