메뉴 건너뛰기




Volumn 22, Issue 2, 2001, Pages 215-221

An efficient algorithm for the optimal polygonal approximation of digitized curves

Author keywords

A; Dynamic programming; Heuristic search; Polygonal approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CURVE FITTING; HEURISTIC METHODS; IMAGE SEGMENTATION; OPTIMIZATION; PROBLEM SOLVING;

EID: 0035096426     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(00)00088-X     Document Type: Article
Times cited : (72)

References (9)
  • 2
    • 0022605733 scopus 로고
    • Optimum uniform piecewise linear approximation of digitized curves
    • (1986) IEEE PAMI , vol.8 , Issue.1 , pp. 67-75
    • Dunham, J.G.1
  • 5
    • 0016916739 scopus 로고
    • An application of heuristic search methods to edge and contour detection
    • (1976) Commun. ACM , vol.19 , pp. 73-83
    • Martelli, A.1
  • 8
    • 0031162930 scopus 로고    scopus 로고
    • Techniques for assessing polygonal approximations of curves
    • (1997) IEEE PAMI , vol.19 , Issue.6 , pp. 659-666
    • Rosin, P.L.1


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