{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:30:58Z","timestamp":1725507058246},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540791256"},{"type":"electronic","value":"9783540791263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79126-3_22","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T14:48:22Z","timestamp":1207320502000},"page":"238-249","source":"Crossref","is-referenced-by-count":4,"title":["Distance Transformation on Two-Dimensional Irregular Isothetic Grids"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Vacavant","sequence":"first","affiliation":[]},{"given":"David","family":"Coeurjolly","sequence":"additional","affiliation":[]},{"given":"Laure","family":"Tougne","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"22_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"issue":"5","key":"22_CR2","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/34.391389","volume":"17","author":"H. Breu","year":"1995","unstructured":"Breu, H., Gil, J., Kirkpatrick, D., Werman, M.: Linear Time Euclidean Distance Algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a017(5), 529\u2013533 (1995)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"22_CR3","unstructured":"CGAL, Computational Geometry Algorithms Library, http:\/\/www.cgal.org"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Chehadeh, Y., Coquin, D., Bolon, P.: A Skeletonization Algorithm Using Chamfer Distance Transformation Adapted to Rectangular Grids. In: 13th International Conference on Pattern Recognition (ICPR 1996), vol. 2, pp. 131\u2013135 (1996)","DOI":"10.1109\/ICPR.1996.546738"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-540-31965-8_29","volume-title":"Discrete Geometry for Computer Imagery","author":"D. Coeurjolly","year":"2005","unstructured":"Coeurjolly, D.: Supercover Model and Digital Straight Line Recognition on Irregular Isothetic Grids. In: Andr\u00e8s, \u00c9., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol.\u00a03429, pp. 311\u2013322. Springer, Heidelberg (2005)"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/TPAMI.2007.54","volume":"29","author":"D. Coeurjolly","year":"2007","unstructured":"Coeurjolly, D., Montanvert, A.: Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a029(3), 437\u2013448 (2007)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"22_CR7","unstructured":"Cuisenaire, O.: Distance Transformations: Fast Algorithms and Applications to Medical Image Processing. PhD Thesis, Universit\u00e9 Catholique de Louvain, Louvain-La-Neuve, Belgium (October 1999)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Devillers, O.: Improved Incremental Randomized Delaunay Triangulation. In: 14th Annual ACM Symposium on Computational Geometry, 106\u2013115 (1998)","DOI":"10.1145\/276884.276896"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.imavis.2004.06.009","volume":"23","author":"C. Fouard","year":"2005","unstructured":"Fouard, C., Malandain, G.: 3-D Chamfer Distances and Norms in Anisotropic Grids. Image and Vision Computing\u00a023(2), 143\u2013158 (2005)","journal-title":"Image and Vision Computing"},{"issue":"9","key":"22_CR10","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1016\/j.patcog.2007.01.001","volume":"40","author":"C. Fouard","year":"2007","unstructured":"Fouard, C., Strand, R., Borgefors, G.: Weighted Distance Transforms Generalized to Modules and their Computation on Point Lattices. Pattern Recognition\u00a040(9), 2453\u20132474 (2007)","journal-title":"Pattern Recognition"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"12","author":"S.W. Golomb","year":"1966","unstructured":"Golomb, S.W.: Run-length Encodings. IEEE Transactions on Information Theory\u00a012(3), 399\u2013401 (1966)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"22_CR12","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/34.689306","volume":"20","author":"W. Guan","year":"1998","unstructured":"Guan, W., Ma, S.: A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a020(7), 757\u2013761 (1998)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Hesselink, W.H., Visser, M., Roerdink, J.B.T.M.: Euclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform. In: Proceedings of 7th International Symposium on Mathematical Morphology, pp. 259\u2013268 (2005)","DOI":"10.1007\/1-4020-3443-1_23"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Jung, D., Gupta, K.K.: Octree-Based Hierarchical Distance Maps for Collision Detection. In: IEEE International Conference on Robotics and Automation, vol.\u00a01, pp. 454\u2013459 (1996)","DOI":"10.1109\/ROBOT.1996.503818"},{"key":"22_CR15","unstructured":"Karavelas, M.I.: Voronoi diagrams in CGAL. In: 22nd European Workshop on Computational Geometry (EWCG 2006), pp. 229\u2013232 (2006)"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/TPAMI.2003.1177156","volume":"25","author":"C.R. Maurer","year":"2003","unstructured":"Maurer, C.R., Qi, R., Raghavan, V.: A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a025(2), 265\u2013270 (2003)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Meijster, A., Roerdink, J.B.T.M., Hesselink, W.H.: A General Algorithm for Computing Distance Transforms in Linear Time. In: Mathematical Morphology and its Applications to Image and Signal Processing, pp. 331\u2013340 (2000)","DOI":"10.1007\/0-306-47025-X_36"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Paglieroni, D.W.: Distance Transforms: Properties and Machine Vision Applications. In: CVGIP: Graphical Models and Image Processing, vol.\u00a054, pp. 56\u201374 (1992)","DOI":"10.1016\/1049-9652(92)90034-U"},{"key":"22_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry - An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Springer, Heidelberg (1985)"},{"issue":"4","key":"22_CR20","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/321356.321357","volume":"13","author":"A. Rosenfeld","year":"1966","unstructured":"Rosenfeld, A., Pfaltz, J.L.: Sequential Operations in Digital Picture Processing. Journal of the ACM\u00a013(4), 471\u2013494 (1966)","journal-title":"Journal of the ACM"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0031-3203(68)90013-7","volume":"1","author":"A. Rosenfeld","year":"1968","unstructured":"Rosenfeld, A., Pfalz, J.L.: Distance Functions on Digital Pictures. Pattern Recognition\u00a01, 33\u201361 (1968)","journal-title":"Pattern Recognition"},{"issue":"11","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1016\/0031-3203(94)90133-3","volume":"27","author":"T. Saito","year":"1994","unstructured":"Saito, T., Toriwaki, J.: New Algorithms for n-dimensional Euclidean Distance Transformation. Pattern Recognition\u00a027(11), 1551\u20131565 (1994)","journal-title":"Pattern Recognition"},{"key":"22_CR23","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley Longman Publishing Co., Inc, Amsterdam (1990)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Schouten, T., Broek, E.: Fast Exact Euclidean Distance (FEED) Transformation. In: 17th International Conference on Pattern Recognition (ICPR 2004), vol.\u00a03, pp. 594\u2013597 (2004)","DOI":"10.1109\/ICPR.2004.1334599"},{"issue":"5","key":"22_CR25","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.patrec.2003.12.006","volume":"25","author":"I.M. Sintorn","year":"2004","unstructured":"Sintorn, I.M., Borgefors, G.: Weighted Distance Transforms for Volume Images Digitized in Elongated Voxel Grids. Pattern Recognition Letters\u00a025(5), 571\u2013580 (2004)","journal-title":"Pattern Recognition Letters"},{"issue":"6","key":"22_CR26","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0736-5845(01)00018-7","volume":"17","author":"J. V\u00f6r\u00f6s","year":"2001","unstructured":"V\u00f6r\u00f6s, J.: Low-Cost Implementation of Distance Maps for Path Planning Using Matrix Quadtrees and Octrees. Robotics and Computer-Integrated Manufacturing\u00a017(6), 447\u2013459 (2001)","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"issue":"11","key":"22_CR27","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1109\/34.166628","volume":"14","author":"X. Wang","year":"1992","unstructured":"Wang, X., Bertrand, G.: Some Sequential Algorithms for a Generalized Distance Transformation Based on Minkowski Operations. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a014(11), 1114\u20131121 (1992)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79126-3_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:09Z","timestamp":1619521869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79126-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540791256","9783540791263"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79126-3_22","relation":{},"subject":[]}}