![]() |
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;
ALGORITHMS;
APPROXIMATION THEORY;
CODES (SYMBOLS);
IMAGE SEGMENTATION;
EDGE 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)
|