||In this seminar, some algorithms for computing distance transforms are considered. We will discuss how these algorithm can be applied to some non-standard grids, such as the face-centered cubic grid and the body-centered cubic grid. The distance functions that will be considered include weighted distances based on neighbourhood sequences and the Euclidean distance. Sufficient conditions for a raster-scanning algorithm to produce distance maps without any errors in some 3D grids will be given. Also, the fast-marching method is applied to the fcc and bcc grids using two different approaches.