The Euclidean distance transform in arbitrary dimensions

DOI10.1016/0167-8655(93)90152-4zbMath0802.68180MaRDI QIDQ4287129

Ingemar Ragnemalm

Publication date: 11 December 1994

Published in: Pattern Recognition Letters (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmEuclidean metricarbitrary dimensionsdistance transformationraster scanning

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Related Items (10)

Efficient preprocessing of complex geometries for CFD simulations ⋮ Locally adaptable mathematical morphology using distance transformations ⋮ Strongly normal sets of contractible tiles in \(n\) dimensions ⋮ Optimal multi-block mesh generation for CFD ⋮ Separable Distance Transformation and Its Applications ⋮ Distance functions based on multiple types of weighted steps combined with neighborhood sequences ⋮ Optimal mesh topology generation for CFD ⋮ Distance Transform Based on Weight Sequences ⋮ Weighted digital distance transforms in four dimensions ⋮ Parallel distance transforms on a linear array architecture

This page was built for publication: The Euclidean distance transform in arbitrary dimensions