메뉴 건너뛰기




Volumn , Issue , 2010, Pages 83-90

Parallel Banding Algorithm to compute exact distance transform with the GPU

Author keywords

Computational geometry; Graphics hardware; Morphological operation; Stipple drawing; Voronoi diagram

Indexed keywords

DISTANCE TRANSFORMS; EUCLIDEAN SKELETON; EXACT ALGORITHMS; EXACT EUCLIDEAN DISTANCE; GRAPHICS HARDWARE; HIGHER DIMENSIONS; INPUT SIZE; INTEGER MEDIAL AXIS; MEMORY ACCESS PATTERNS; MORPHOLOGICAL OPERATIONS; OTHER ALGORITHMS; STIPPLE DRAWING; TOTAL WORK; VOLUMETRIC DATA; VORONOI DIAGRAMS; WEIGHTED CENTROIDAL VORONOI DIAGRAMS;

EID: 77951261528     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1730804.1730818     Document Type: Conference Paper
Times cited : (136)

References (24)
  • 3
    • 53149084846 scopus 로고    scopus 로고
    • Fast hierarchical 3D distance transforms on the GPU
    • CUNTZ, N., AND KOLB, A. 2007. Fast hierarchical 3D distance transforms on the GPU. In Eurographics 2007, 93-96.
    • (2007) Eurographics 2007 , pp. 93-96
    • Cuntz, N.1    Kolb, A.2
  • 5
    • 40049086117 scopus 로고    scopus 로고
    • 2D Euclidean distance transform algorithms: A comparative survey
    • FABBRI, R., COSTA, L. D. F., TORELLI, J. C., AND BRUNO, O. M. 2008. 2D Euclidean distance transform algorithms: A comparative survey. ACM Computing Survey 40, 1, 1-44.
    • (2008) ACM Computing Survey , vol.40 , Issue.1 , pp. 1-44
    • Fabbri, R.1    Costa, L.D.F.2    Torelli, J.C.3    Bruno, O.M.4
  • 6
    • 36048930867 scopus 로고    scopus 로고
    • Addison Wesley, ch. Parallel Prefix Sum (Scan) with CUDA
    • HARRIS, M., SENGUPTA, S., AND OWENS, J. D. 2007. GPU Gems 3. Addison Wesley, ch. Parallel Prefix Sum (Scan) with CUDA, 815-876.
    • (2007) GPU Gems 3 , pp. 815-876
    • Harris, M.1    Sengupta, S.2    Owens, J.D.3
  • 7
    • 0032318505 scopus 로고    scopus 로고
    • Optimal parallel algorithms for finding proximate points, with applications
    • HAYASHI, T., NAKANO, K., AND OLARIU, S. 1998. Optimal parallel algorithms for finding proximate points, with applications. IEEE Transaction on Parallel and Distributed Systems 9, 12, 1153-1166. (Pubitemid 128744924)
    • (1998) IEEE Transactions on Parallel and Distributed Systems , vol.9 , Issue.12 , pp. 1153-1166
    • Hayashi, T.1    Nakano, K.2    Olariu, S.3
  • 8
    • 56549102821 scopus 로고    scopus 로고
    • Euclidean skeletons of digital image and volume data in linear time by the integer medial axis transform
    • Dec
    • HESSELINK, W., AND ROERDINK, J. 2008. Euclidean skeletons of digital image and volume data in linear time by the integer medial axis transform. IEEE Transactions on Pattern Analysis and Machine Intelligence 30, 12 (Dec.), 2204-2217.
    • (2008) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.30 , Issue.12 , pp. 2204-2217
    • Hesselink, W.1    Roerdink, J.2
  • 11
    • 0002814884 scopus 로고
    • Fast computation of the Euclidean distance maps for binary images
    • KOLOUNTZAKIS, M., AND KUTULAKOS, K. 1992. Fast computation of the Euclidean distance maps for binary images. Information Processing Letters 43, 181-184.
    • (1992) Information Processing Letters , vol.43 , pp. 181-184
    • Kolountzakis, M.1    Kutulakos, K.2
  • 12
    • 0037624720 scopus 로고    scopus 로고
    • Parallel computation of the Euclidean distance transform on a three-dimensional image array
    • LEE, Y.-H., HORNG, S.-J., AND SEITZER, J. 2003. Parallel computation of the Euclidean distance transform on a three-dimensional image array. IEEE Transaction on Parallel and Distributed Systems 14, 3, 203-212.
    • (2003) IEEE Transaction on Parallel and Distributed Systems , vol.14 , Issue.3 , pp. 203-212
    • Lee, Y.-H.1    Horng, S.-J.2    Seitzer, J.3
  • 14
    • 0037325736 scopus 로고    scopus 로고
    • A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions
    • MAURER, JR., C. R., QI, R., AND RAGHAVAN, V. 2003. A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 2, 265-270.
    • (2003) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.25 , Issue.2 , pp. 265-270
    • Maurer Jr., C.R.1    Qi, R.2    Raghavan, V.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.