مرکز منطقه ای اطلاع رساني علوم و فناوري - An optimal O(n) algorithm for identifying line segments from a sequence of chain codes

Title of article :

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

Author/Authors :

Jianxing Yuan، نويسنده , , Ching Y. Suen، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 1995

Pages :

From page :

635

To page :

646

Keywords :

Straight line detection Chain codes Digital straight lines Line dra wings ContoursPolygonal approximation

Journal title :

PATTERN RECOGNITION

Serial Year :

1995

Journal title :

PATTERN RECOGNITION

Record number :

208306

Link To Document :