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

Pattern Recognition

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

  Yuan, Jianxing ^a   Suen, Ching Y ^a  

^a Dept of Electrical and Computer Engineering   (Canada)

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

References (16)

1. Boundary encoding and processing
2. Digital straight line segments
3. Regular arcs in digital contours
4. Erratum
5. On the parallel generation of straight digital lines
6. On the Freeman's conjecture about the chain code of a line
7. On the chain code of a line
8. On the straightness of digital arcs
9. Decomposition of discrete curves into piecewise straight segments in linear time
10. Linguistic methods for the descriptions of a straight line on a grid
11. Using the FFT to determine digital straight line chain codes
12. Using FHT to determine digital straight line chain codes
13. On approximating polygonal curves in two and three dimensions
14. A new approach to polygonal approximation
15. On the encoding of arbitrary geometric configuration