A new method of the euclidean distance map generation is developed which reduces the number of multiplication operations needed to compute distances. This method belongs to a class of the ordered propagation distance transforms using mask whose shape depends on a direction of the distance value propagation. To obtain euclidean distances, we apply two non-euclidean transforms (city block and chessboard) simultaneously so that our approach is faster than the standard algorithms because it uses only additions instead of multiplication operatons when labelling the distance map. Experiments confirm a correctness of our method and memory requirements for it do not exceed those for other transforms with the ordered propagation.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.