thinning algorithm
-
someone please help on the thinning algorithm used to identify a character .I am not being able to code the algorithm in c# though i have the whole logic and code written in C . can some1 please help me . the c code is as follows ....how do i code the same in c# please help http://pages.cpsc.ucalgary.ca/~parker/thin.c[^]
-
someone please help on the thinning algorithm used to identify a character .I am not being able to code the algorithm in c# though i have the whole logic and code written in C . can some1 please help me . the c code is as follows ....how do i code the same in c# please help http://pages.cpsc.ucalgary.ca/~parker/thin.c[^]
After a quick look through the code I think it just translates straight into C#. The only tricky bit is the b parameter to t1a which must be called using ref. I suggest you pick up an introductory C# book. If you understand the C you should have no problems translating it to C#. As a side issue it's generally not a good idea to provide links to code. People will be wary of following them. Why not just copy and paste it - if it's not too long.
Regards David R
-
someone please help on the thinning algorithm used to identify a character .I am not being able to code the algorithm in c# though i have the whole logic and code written in C . can some1 please help me . the c code is as follows ....how do i code the same in c# please help http://pages.cpsc.ucalgary.ca/~parker/thin.c[^]
Hello, Did not run the C version of the algorithm you've pointed, but there are some already made implementation of thinning in C#, which are made in AForge.NET Framework[^]. One example is to use math morphology filters for this: [^]. Another is simple skeletonization filter[^].
With best regards, Andrew Kirillov AForge.NET