메뉴 건너뛰기




Volumn 35, Issue 11, 2002, Pages 2539-2548

Efficient algorithms for 3-D polygonal approximation based on LISE criterion

Author keywords

3 D polygonal approximation; Algorithms; Dynamic programming; Integral square error criterion; Sampling technique; Shortest path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERRORS;

EID: 0036833286     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(01)00226-6     Document Type: Article
Times cited : (6)

References (21)
  • 4
    • 0026958249 scopus 로고
    • Piecewise linear approximation of plane curves by perimeter optimization
    • (1992) Pattern Recognition , vol.25 , Issue.12 , pp. 1535-1543
    • Sato, Y.1


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