Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISVD.2007.41
Title: Variants of jump flooding algorithm for computing discrete Voronoi diagrams
Authors: Rong, G.
Tan, T.-S. 
Issue Date: 2007
Source: Rong, G.,Tan, T.-S. (2007). Variants of jump flooding algorithm for computing discrete Voronoi diagrams. Proceedings - ISVD 2007 The 4th International Symposium on Voronoi Diagrams in Science and Engineering 2007 : 176-181. ScholarBank@NUS Repository. https://doi.org/10.1109/ISVD.2007.41
Abstract: 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. © 2007 IEEE.
Source Title: Proceedings - ISVD 2007 The 4th International Symposium on Voronoi Diagrams in Science and Engineering 2007
URI: http://scholarbank.nus.edu.sg/handle/10635/41748
ISBN: 0769528694
DOI: 10.1109/ISVD.2007.41
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

22
checked on Dec 13, 2017

Page view(s)

58
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.