메뉴 건너뛰기




Volumn 28, Issue 5, 1995, Pages 635-646

An optimal O(n) algorithm for identifying line segments from a sequence of chain codes

Author keywords

Chain codes; Contours; Digital straight lines; Line drawings; Polygonal approximation; Straight line detection

Indexed keywords

CHAIN CODES; CONTOURS; DIGITAL STRAIGHT LINES; LINE DRAWINGS; LINE SEGMENTS; POLYGONAL APPROXIMATION; STRAIGHT LINE DETECTION;

EID: 0029307202     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(94)00132-6     Document Type: Article
Times cited : (26)

References (16)
  • 13
    • 0024765754 scopus 로고
    • Using FHT to determine digital straight line chain codes
    • (1989) Electronics Lett. , vol.25 , pp. 1629-1631
    • Hsu1    Liu2


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