Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams
School of Computing, National University of Singapore
In ISVD ’07: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007), pp. 176-181.
@conference{rong2007variants,
title={Variants of jump flooding algorithm for computing discrete Voronoi diagrams},
author={Rong, G. and Tan, T.S.},
booktitle={Voronoi Diagrams in Science and Engineering, 2007. ISVD’07. 4th International Symposium on},
pages={176–181},
isbn={0769528694},
year={2007},
organization={IEEE}
}
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. This paper presents three novel variants of JFA. They focus on different aspects of JFA: the first variant can further reduce the errors of JFA; the second variant can greatly increase the speed of JFA; and the third variant enables JFA to compute Voronoi diagrams in 3D space in a slice-by-slice manner, without a high end graphics processing unit. These variants are orthogonal to each other. In other words, it is possible to combine any two or all of them together.
January 7, 2011 by hgpu
