i
i
i
i
i
i
i
i
1. 2D Distance Field Generation with the GPU 407
Bibliography
[Cao et al. 10] Thanh-Tung Cao, Ke Tang, Anis Mohamed, and Tiow-Seng Tan. “Par-
allel Banding Algorithm to Compute Exact Distance Transform with the GPU.”
In I3D ’10: Proceedings of the 2010 ACM SIGGRAPH Symposium on Interactive
3D Graphics and Games, pp. 83–90. New York: ACM, 2010.
[Danielsson 80] P. E. Danielsson. “Euclidean Distance Mapping.” Computer Graphics
and Image Processing 14:3 (1980), 227–248.
[Fabbri et al. 08] Ricardo Fabbri, Luciano da F. Costa, Julio C. Torelli, and Odemir M.
Bruno. “2D Euclidean Distance Transform Algorithms: A Comparative Survey.”
ACM Computing Surveys 40:1 (2008), 2:1–2:44.
[Green 07] Chris Green. “Improved Alpha-Tested Magnification for Vector Textures
and Special Effects.” In SIGGRAPH ’07: ACM SIGGRAPH 2007 Courses, pp. 9–
18. New York: ACM, 2007.
[Lotufo and Zampirolli 01] Roberto de Alencar Lotufo and Francisco A. Zampirolli.
“Fast Multidimensional Parallel Euclidean Distance Transform Based on Math-
ematical Morphology.” In SIBGRAPI ’01: Proceedings of the 14th Brazilian Sym-
posium on Computer Graphics and Image Processing, pp. 100–105. Washington,
DC: IEEE Computer Society, 2001.
[Qin et al. 06] Zheng Qin, Michael D. McCool, and Craig S. Kaplan. “Real-Time
Texturemapped Vector Glyphs.” In Symposium on Interactive 3D Graphics and
Games, pp. 125–132. New York: ACM Press, 2006.
[Rong and Tan 06] Guodong Rong and Tiow-Seng Tan. “Jump Flooding: An Efficient
and Effective Communication on GPU.” pp. 185–192. Hingham, MA: Charles River
Media, 2006.
[Saito and Toriwaki 94] Toyofumi Saito and Jun-Ichiro Toriwaki. “New algorithms for
Euclidean Distance Transformation of an n-Dimensional Digitized Picture with
Applications.” Pattern Recognition 27:11 (1994), 1551–1565.
i
i
i
i
i
i
i
i
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.