Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Parallel programming: an introduction
Parallel programming: an introduction
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Evaluation of the streams-C C-to-FPGA compiler: an applications perspective
FPGA '01 Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays
Parallel Algorithms to Find the Voronoi Diagram and the Order-k Voronoi Diagram
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Parallel Solutions to Geometric Problems on the Scan Model of Computation
Parallel Solutions to Geometric Problems on the Scan Model of Computation
Brook for GPUs: stream computing on graphics hardware
ACM SIGGRAPH 2004 Papers
| Hi-index | 0.00 |
A Computational Geometry Problem, the "Mobile and Unreliable Service Provider", is introduced. Several heuristics to solve this problem are presented, which take advantage of the computations performed when calculating a discrete approximation to the Voronoi diagram. These heuristics, due to their low communication overhead, are appropriate for parallel environments.