메뉴 건너뛰기




Volumn 3221, Issue , 2004, Pages 809-821

A Straight Skeleton Approximating the Medial Axis

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; WAVEFRONTS;

EID: 35048874672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article
Times cited : (29)

References (14)
  • 1
    • 0001803094 scopus 로고
    • A Transformation for Extracting New Descriptors of Shape
    • ed: W. Wathen-Dunn. MIT Press
    • Blum, H.: A Transformation for Extracting New Descriptors of Shape. Symp. Models for Speech and Visual Form, ed: W. Wathen-Dunn. MIT Press (1967) 362-381.
    • (1967) Symp. Models for Speech and Visual Form , pp. 362-381
    • Blum, H.1
  • 3
    • 0023978068 scopus 로고
    • A Process Grammar for Shape
    • Leyton, M.: A Process Grammar for Shape. Art. Intelligence 34 (1988) 213-247.
    • (1988) Art. Intelligence , vol.34 , pp. 213-247
    • Leyton, M.1
  • 4
    • 0029264216 scopus 로고
    • Hierarchic Voronoi Skeletons
    • Ogniewicz, R. L., Kubler, O.: Hierarchic Voronoi Skeletons. Pattern Recognition 28(3) (1995) 343-359.
    • (1995) Pattern Recognition , vol.28 , Issue.3 , pp. 343-359
    • Ogniewicz, R.L.1    Kubler, O.2
  • 8
    • 84949770621 scopus 로고    scopus 로고
    • A Straight Skeleton Approximating the Linear Axis
    • Tǎnase, M., Veltkamp, R.C.: A Straight Skeleton Approximating the Linear Axis. TR (2004).
    • (2004) TR
    • Tǎnase, M.1    Veltkamp, R.C.2
  • 9
    • 0033423090 scopus 로고    scopus 로고
    • Finding the Medial Axis of a Simple Polygon in Linear Time
    • Chin, F., Snocyink, J., Wang, C.-A.: Finding the Medial Axis of a Simple Polygon in Linear Time. Discrete Computational Geometry 21(3) (1999) 405-420.
    • (1999) Discrete Computational Geometry , vol.21 , Issue.3 , pp. 405-420
    • Chin, F.1    Snocyink, J.2    Wang, C.-A.3
  • 10
    • 0033450714 scopus 로고    scopus 로고
    • Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
    • Eppstein, D., Erickson, J.: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Discrete and Computational Geometry 22(4) (1999) 569-592.
    • (1999) Discrete and Computational Geometry , vol.22 , Issue.4 , pp. 569-592
    • Eppstein, D.1    Erickson, J.2
  • 12
    • 0001489753 scopus 로고
    • Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature
    • Douglas, D.H., Peucker, T.K.: Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature. The Canadian Cartographer 10(2) (1973) 112-122.
    • (1973) The Canadian Cartographer , vol.10 , Issue.2 , pp. 112-122
    • Douglas, D.H.1    Peucker, T.K.2


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