메뉴 건너뛰기




Volumn 16, Issue 4, 2002, Pages 192-195

Curve morphing by weighted mean of strings

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPHIC METHODS; PROBLEM SOLVING; PRODUCT DESIGN; ROBOTICS; COMPUTER GRAPHICS;

EID: 32444438091     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (13)
  • 1
    • 0035197949 scopus 로고    scopus 로고
    • Weighted mean of a pair of graphs
    • H. Bunke and S. Günter, Weighted mean of a pair of graphs, Computing, 67: 209-224, 2001.
    • (2001) Computing , vol.67 , pp. 209-224
    • Bunke, H.1    Günter, S.2
  • 3
    • 0031370547 scopus 로고    scopus 로고
    • Warp-guided object-space morphing
    • E. Carmel and D. Cohen-Or, Warp-guided object-space morphing, The Visual Computer, 13: 465-478, 1997.
    • (1997) The Visual Computer , vol.13 , pp. 465-478
    • Carmel, E.1    Cohen-Or, D.2
  • 5
    • 85112488796 scopus 로고    scopus 로고
    • A new regularized approach for contour morphing
    • G. Gong and B. Parvin, A new regularized approach for contour morphing, Proc. of CVPR, 458-463, 2000.
    • (2000) Proc. of CVPR , pp. 458-463
    • Gong, G.1    Parvin, B.2
  • 6
    • 0035251288 scopus 로고    scopus 로고
    • Guaranteed intersection-free polygon morphing
    • C. Gotsman and V. Surazhsky, Guaranteed intersection-free polygon morphing, Computers & Graphics, 25: 67-75, 2001.
    • (2001) Computers & Graphics , vol.25 , pp. 67-75
    • Gotsman, C.1    Surazhsky, V.2
  • 7
    • 0030190375 scopus 로고    scopus 로고
    • Efficient dynamic programming alignment of cyclic strings by shift elimination
    • J. Gregor and M.G. Thomason, Efficient dynamic programming alignment of cyclic strings by shift elimination, Pattern Recognition, 29(7): 1179-1185, 1996.
    • (1996) Pattern Recognition , vol.29 , Issue.7 , pp. 1179-1185
    • Gregor, J.1    Thomason, M.G.2
  • 8
    • 34147094325 scopus 로고    scopus 로고
    • Speeding up the computation of the edit distance for cyclic strings
    • A. Marzal and S. Barrachina, Speeding up the computation of the edit distance for cyclic strings, Proc. of ICPR, 895-898, 2000.
    • (2000) Proc. of ICPR , pp. 895-898
    • Marzal, A.1    Barrachina, S.2
  • 9
    • 0026903040 scopus 로고
    • A theory of multiscale curvature based shape representation of planar curves
    • H. Mokhatarian and A. Mackworth, A theory of multiscale curvature based shape representation of planar curves, IEEE Trans. on PAMI, 14: 789-805, 1992.
    • (1992) IEEE Trans. on PAMI , vol.14 , pp. 789-805
    • Mokhatarian, H.1    Mackworth, A.2
  • 10
    • 0030246761 scopus 로고    scopus 로고
    • Matching and interpolation of shapes using unions of circles
    • V. Ranjan and A. Fournier, Matching and interpolation of shapes using unions of circles, Proc. of EUROGRAPHICS, 129-142, 1996.
    • (1996) Proc. of EUROGRAPHICS , pp. 129-142
    • Ranjan, V.1    Fournier, A.2
  • 11
    • 0026890246 scopus 로고
    • A physically based approach to 2-D shape blending
    • T.W. Sederberg and E. Greenwood, A physically based approach to 2-D shape blending, Proc. of SIGGRAPH, 25-34, 1992.
    • (1992) Proc. of SIGGRAPH , pp. 25-34
    • Sederberg, T.W.1    Greenwood, E.2
  • 13
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • R.A. Wagner and M.J. Fischer, The string-to-string correction problem, Journal of the ACM, 21(1): 168-173, 1974.
    • (1974) Journal of the ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2


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