메뉴 건너뛰기




Volumn 12, Issue , 2003, Pages 325-336

On the min DSS problem of closed discrete curves

Author keywords

discrete curves and segments; Min DSS Problem; optimal complexity.; tangential cover

Indexed keywords


EID: 26444510500     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00496-2     Document Type: Article
Times cited : (5)

References (8)
  • 2
    • 34247163511 scopus 로고    scopus 로고
    • J. Bresenham, An incremental algorithm for digital plotting, in: Proceedings of ACM National Conference, 1963
  • 4
    • 34247162158 scopus 로고    scopus 로고
    • J.Berstel, M.Pocchiola, Random generation of. nite sturmian words, Tech.Rep. 93-8, LIENS -Départ.de Math éematiques et Informatique, ENS Paris (1993).
  • 7
    • 2442628697 scopus 로고    scopus 로고
    • Digital straightness
    • Fourey S., Herman G., and Kong T. (Eds), Elsevier Science Publishers
    • Rosenfeld A., and Klette R. Digital straightness. In: Fourey S., Herman G., and Kong T. (Eds). IWCIA 2001 Proceedings, Vol. 46 of ENTCS (2001), Elsevier Science Publishers
    • (2001) IWCIA 2001 Proceedings, Vol. 46 of ENTCS
    • Rosenfeld, A.1    Klette, R.2
  • 8
    • 84958780472 scopus 로고    scopus 로고
    • Optimal time computation of the tangent of a discrete curve: application to the curvature
    • Bertrand G., Couprie M., and Perroton L. (Eds), Springer-Verlag
    • th (1999), Springer-Verlag 31-40
    • (1999) th , pp. 31-40
    • Feschet, L.1    Tougne, F.2


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