Introduction - If you have any usage issues, please Google them yourself
Euclidean Distance Transform has been widely studied in computational geometry, image processing, computer graphics and pattern recognition. Euclidean distance has been computed through different algorithms like parallel, linear time algorithms etc. On the basis of efficiency, accuracy and numerical computations, existing and proposed techniques has been compared. This study proposed a new technique of finding Euclidian distance using sequential algorithm. An experimental evaluation has shown that proposed technique has reduced the drawbacks of existing techniques. And the use of sequential algorithm scans has reduced the computational cost.