Rapid Euclidean distance transform using grayscale morphology decomposition

A fast and exact Euclidean distance transformation using grayscale mathematical morphology is presented. The large structuring element required for this operation is decomposed into iterative applications of simple 3*3 windows. This is possible because the square of the Euclidean distance matrix is easily decomposable. Non-square pixels can also be used in this application.<
>