@incollection{meijsterGeneralAlgorithmComputing2000,
  title = {A General Algorithm for Computing Distance Transforms in Linear Time},
  booktitle = {Mathematical {{Morphology}} and Its {{Applications}} to {{Image}} and {{Signal Processing}}},
  author = {Meijster, A. and Roerdink, J. B. T. M. and Hesselink, W. H.},
  editor = {Goutsias, John and Vincent, Luc and Bloomberg, DanS},
  year = {2000},
  volume = {18},
  pages = {331--340},
  publisher = {{Springer US}},
  doi = {10.1007/0-306-47025-x\\_36},
  abstract = {A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorithm can be easily parallelized on shared memory computers. The algorithm can be used for the computation of the exact Euclidean, Manhattan (L1 norm), and chessboard distance (L{$\infty$} norm) transforms.},
  keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-3759792,algorithms,computational-science,data-transformation-modelling,distance-analysis,gridded-data},
  lccn = {INRMM-MiD:c-3759792},
  series = {Computational {{Imaging}} and {{Vision}}}
}

{"_id":"gqPQmxc5HAsF5hgbJ","bibbaseid":"meijster-roerdink-hesselink-ageneralalgorithmforcomputingdistancetransformsinlineartime-2000","downloads":0,"creationDate":"2017-06-22T15:25:07.039Z","title":"A General Algorithm for Computing Distance Transforms in Linear Time","author_short":["Meijster, A.","Roerdink, J. B. T. M.","Hesselink, W. H."],"year":2000,"bibtype":"incollection","biburl":"https://sharefast.me/php/download.php?id=zOUKvA&token=29","bibdata":{"bibtype":"incollection","type":"incollection","title":"A General Algorithm for Computing Distance Transforms in Linear Time","booktitle":"Mathematical Morphology and Its Applications to Image and Signal Processing","author":[{"propositions":[],"lastnames":["Meijster"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Roerdink"],"firstnames":["J.","B.","T.","M."],"suffixes":[]},{"propositions":[],"lastnames":["Hesselink"],"firstnames":["W.","H."],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Goutsias"],"firstnames":["John"],"suffixes":[]},{"propositions":[],"lastnames":["Vincent"],"firstnames":["Luc"],"suffixes":[]},{"propositions":[],"lastnames":["Bloomberg"],"firstnames":["DanS"],"suffixes":[]}],"year":"2000","volume":"18","pages":"331–340","publisher":"Springer US","doi":"10.1007/0-306-47025-x\\_36","abstract":"A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorithm can be easily parallelized on shared memory computers. The algorithm can be used for the computation of the exact Euclidean, Manhattan (L1 norm), and chessboard distance (L$\\infty$ norm) transforms.","keywords":"*imported-from-citeulike-INRMM,~INRMM-MiD:c-3759792,algorithms,computational-science,data-transformation-modelling,distance-analysis,gridded-data","lccn":"INRMM-MiD:c-3759792","series":"Computational Imaging and Vision","bibtex":"@incollection{meijsterGeneralAlgorithmComputing2000,\n title = {A General Algorithm for Computing Distance Transforms in Linear Time},\n booktitle = {Mathematical {{Morphology}} and Its {{Applications}} to {{Image}} and {{Signal Processing}}},\n author = {Meijster, A. and Roerdink, J. B. T. M. and Hesselink, W. H.},\n editor = {Goutsias, John and Vincent, Luc and Bloomberg, DanS},\n year = {2000},\n volume = {18},\n pages = {331--340},\n publisher = {{Springer US}},\n doi = {10.1007/0-306-47025-x\\\\_36},\n abstract = {A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorithm can be easily parallelized on shared memory computers. The algorithm can be used for the computation of the exact Euclidean, Manhattan (L1 norm), and chessboard distance (L{$\\infty$} norm) transforms.},\n keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-3759792,algorithms,computational-science,data-transformation-modelling,distance-analysis,gridded-data},\n lccn = {INRMM-MiD:c-3759792},\n series = {Computational {{Imaging}} and {{Vision}}}\n}\n\n","author_short":["Meijster, A.","Roerdink, J. B. T. M.","Hesselink, W. H."],"editor_short":["Goutsias, J.","Vincent, L.","Bloomberg, D."],"key":"meijsterGeneralAlgorithmComputing2000","id":"meijsterGeneralAlgorithmComputing2000","bibbaseid":"meijster-roerdink-hesselink-ageneralalgorithmforcomputingdistancetransformsinlineartime-2000","role":"author","urls":{},"keyword":["*imported-from-citeulike-INRMM","~INRMM-MiD:c-3759792","algorithms","computational-science","data-transformation-modelling","distance-analysis","gridded-data"],"downloads":0},"search_terms":["general","algorithm","computing","distance","transforms","linear","time","meijster","roerdink","hesselink"],"keywords":["algorithms","computational-science","data-transformation-modelling","distance-analysis","gridded-data","*imported-from-citeulike-inrmm","~inrmm-mid:c-3759792"],"authorIDs":[],"dataSources":["5S2zj2hKW8TWTkuMq"]}