Conference Paper: Generalized Voronoi diagram computation on GPU

File Download Links for fulltext
(May Require Subscription)
Supplementary
  • Basic View
  • Metadata View
  • XML View
TitleGeneralized Voronoi diagram computation on GPU
AuthorsYuan, Z1
Rong, G2
Guo, X2
Wang, W1
KeywordsGeneralized Voronoi Diagram
Graphics Hardware
Jump Flooding Algorithm
Issue Date2011
CitationProceedings - 2011 8Th International Symposium On Voronoi Diagrams In Science And Engineering, Isvd 2011, 2011, p. 75-82 [How to Cite?]
DOI: http://dx.doi.org/10.1109/ISVD.2011.18
AbstractWe study the problem of using the GPU to compute the generalized Voronoi diagram (GVD) for higher-order sites, such as line segments and curves. This problem has applications in many fields, including computer animation, pattern recognition and so on. A number of methods have been proposed that use the GPU to speed up the computation of the GVD. The jump flooding algorithm (to be called JFA) is such an efficient GPU-based method that is particularly suitable for computing the ordinary Voronoi diagram of point sites. We improve the jump flooding algorithm and apply it to computing the GVD. Specifically, instead of directly propagating the complete information of a site (i.e. the coordinates or other geometric parameters) as in the original JFA, we store the site information in a 1-D texture, and propagate only the IDs, which are short integers, of the sites in another 2D texture to generate the Voronoi diagram. This simple strategy avoids storing redundant data and leads to considerately more accurate computation of the GVD with much less memory than using the original JFA, with only moderate increase of the running time. © 2011 IEEE.
DOIhttp://dx.doi.org/10.1109/ISVD.2011.18
ReferencesReferences in Scopus
DC Field
Value
dc.contributor.authorYuan, Z
dc.contributor.authorRong, G
dc.contributor.authorGuo, X
dc.contributor.authorWang, W
dc.date.accessioned2011-09-23T06:04:35Z
dc.date.available2011-09-23T06:04:35Z
dc.date.issued2011
dc.description.abstractWe study the problem of using the GPU to compute the generalized Voronoi diagram (GVD) for higher-order sites, such as line segments and curves. This problem has applications in many fields, including computer animation, pattern recognition and so on. A number of methods have been proposed that use the GPU to speed up the computation of the GVD. The jump flooding algorithm (to be called JFA) is such an efficient GPU-based method that is particularly suitable for computing the ordinary Voronoi diagram of point sites. We improve the jump flooding algorithm and apply it to computing the GVD. Specifically, instead of directly propagating the complete information of a site (i.e. the coordinates or other geometric parameters) as in the original JFA, we store the site information in a 1-D texture, and propagate only the IDs, which are short integers, of the sites in another 2D texture to generate the Voronoi diagram. This simple strategy avoids storing redundant data and leads to considerately more accurate computation of the GVD with much less memory than using the original JFA, with only moderate increase of the running time. © 2011 IEEE.
dc.description.natureLink_to_subscribed_fulltext
dc.identifier.citationProceedings - 2011 8Th International Symposium On Voronoi Diagrams In Science And Engineering, Isvd 2011, 2011, p. 75-82 [How to Cite?]
DOI: http://dx.doi.org/10.1109/ISVD.2011.18
dc.identifier.doihttp://dx.doi.org/10.1109/ISVD.2011.18
dc.identifier.epage82
dc.identifier.hkuros194929
dc.identifier.scopuseid_2-s2.0-80052631259
dc.identifier.spage75
dc.identifier.urihttp://hdl.handle.net/10722/140004
dc.languageeng
dc.relation.ispartofProceedings - 2011 8th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2011
dc.relation.referencesReferences in Scopus
dc.subjectGeneralized Voronoi Diagram
dc.subjectGraphics Hardware
dc.subjectJump Flooding Algorithm
dc.titleGeneralized Voronoi diagram computation on GPU
dc.typeConference_Paper
Author Affiliations
  1. The University of Hong Kong
  2. University of Texas at Dallas