I require to find the number of DSL (Digital Straight Line) in any given alphabet. For example A.
The conditions to be fulfilled for a point to be DSL are:
1) There exist runs of pixels in at most 2 directions which differ by 45degree.
2) For runs of 2 directions,the run lengths in one of the directions
is always one.
3) The run length in the other direction can have at most 2 values
differing by unity(e.g. n and n+1).
That's nice, how about asking a question. No one will do the work for you.
The first method would be to read/get the pixelmap (a map of pixels), ask specific questions if you have problems with that or other stages after...
Seems to me that an 'A' would have lines of pixels in three directions:
One for each leg of the letter, and a third for the horizontal line between the legs.
Adak is cleverHow many lines will be in B?
Infinite
