A fast and robust seed flooding algorithm on GPU for Voronoi diagram generation

Voronoi diagram (VD) is a fundamental data structure in computational geometry. With the rapid development of programmable graphics programmable units, utilizing GPU to construct VD has been an optimal strategy. Considering the bridles of state-of-art algorithms, a seed flooding algorithm (SFA) is presented to achieve both robustness and high performance. The experimental results shows that SFA can construct exact discrete Voronoi diagrams with comparable performance of jump flooding algorithm (JFA), which is considered as the fastest approximate algorithm on GPU. The limitations of this algorithm are also analyzed and the schemes to alleviate the negative effect brought by bad inputs is presented.