{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:19:53Z","timestamp":1760368793875},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_19","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T14:48:22Z","timestamp":1207320502000},"page":"201-212","source":"Crossref","is-referenced-by-count":6,"title":["Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids \u2013 Metricity and Algorithms"],"prefix":"10.1007","author":[{"given":"Robin","family":"Strand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedek","family":"Nagy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1109\/23.467854","volume":"42","author":"S. Matej","year":"1995","unstructured":"Matej, S., Lewitt, R.M.: Efficient 3D grids for image reconstruction using spherically-symmetric volume elements. IEEE Transactions on Nuclear Science\u00a042(4), 1361\u20131370 (1995)","journal-title":"IEEE Transactions on Nuclear Science"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.cviu.2005.04.006","volume":"100","author":"R. Strand","year":"2005","unstructured":"Strand, R., Borgefors, G.: Distance transforms for three-dimensional grids with non-cubic voxels. Computer Vision and Image Understanding\u00a0100(3), 294\u2013311 (2005)","journal-title":"Computer Vision and Image Understanding"},{"issue":"9","key":"19_CR3","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":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.dam.2006.09.005","volume":"155","author":"R. Strand","year":"2007","unstructured":"Strand, R., Nagy, B.: Distances based on neighbourhood sequences in non-standard three-dimensional grids. Discrete Applied Mathematics\u00a0155(4), 548\u2013557 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR5","unstructured":"Carr, H., Theussl, T., M\u00f6ller, T.: Isosurfaces on optimal regular samples. In: Bonneau, G.-P., Hahmann, S., C.D.H. (eds.) Proceedings of the symposium on Data visualisation 2003, Eurographics Association, pp. 39\u201348 (2003)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Strand, R., Stelldinger, P.: Topology preserving marching cubes-like algorithms on the face-centered cubic grid. In: Proceedings of 14th International Conference on Image Analysis and Processing (ICIAP 2007), Modena, Italy, pp. 781\u2013788 (2007)","DOI":"10.1109\/ICIAP.2007.4362871"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.patrec.2003.12.002","volume":"25","author":"D. Coeurjolly","year":"2004","unstructured":"Coeurjolly, D., Miguet, S., Tougne, L.: 2D and 3D visibility in discrete geometry: an application to discrete geodesic paths. Pattern Recognition Letters\u00a025(5), 561\u2013570 (2004)","journal-title":"Pattern Recognition Letters"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/34.19041","volume":"11","author":"B.J.H. Verwer","year":"1989","unstructured":"Verwer, B.J.H., Verbeek, P.W., Dekker, S.T.: An efficient uniform cost algorithm applied to distance transforms. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a011(4), 425\u2013429 (1989)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Strand, R., Malmberg, F., Svensson, S.: Minimal cost-path for path-based distances. In: Petrou, M., Saram\u00e4ki, T., Er\u00e7il, A., Loncaric, S. (eds.) ISPA 2007, pp. 379\u2013384 (2007)","DOI":"10.1109\/ISPA.2007.4383723"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S0734-189X(86)80047-0","volume":"34","author":"G. Borgefors","year":"1986","unstructured":"Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics, and Image Processing\u00a034, 344\u2013371 (1986)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"19_CR11","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., Pfaltz, J.L.: Distance functions on digital pictures. Pattern Recognition\u00a01, 33\u201361 (1968)","journal-title":"Pattern Recognition"},{"issue":"4","key":"19_CR12","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"},{"issue":"5","key":"19_CR13","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/0031-3203(84)90048-7","volume":"17","author":"M. Yamashita","year":"1984","unstructured":"Yamashita, M., Honda, N.: Distance functions defined by variable neighborhood sequences. Pattern Recognition\u00a017(5), 509\u2013513 (1984)","journal-title":"Pattern Recognition"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0031-3203(86)90014-2","volume":"19","author":"M. Yamashita","year":"1986","unstructured":"Yamashita, M., Ibaraki, T.: Distances defined by neighborhood sequences. Pattern Recognition\u00a019(3), 237\u2013246 (1986)","journal-title":"Pattern Recognition"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0255(87)90019-3","volume":"42","author":"P.P. Das","year":"1987","unstructured":"Das, P.P., Chakrabarti, P.P.: Distance functions in digital geometry. Information Sciences\u00a042, 113\u2013136 (1987)","journal-title":"Information Sciences"},{"issue":"3","key":"19_CR16","doi-asserted-by":"crossref","first-page":"483","DOI":"10.5486\/PMD.2003.2875","volume":"63","author":"B. Nagy","year":"2003","unstructured":"Nagy, B.: Distance functions based on neighbourhood sequences. Publicationes Mathematicae Debrecen\u00a063(3), 483\u2013493 (2003)","journal-title":"Publicationes Mathematicae Debrecen"},{"issue":"15","key":"19_CR17","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1016\/j.patrec.2007.05.016","volume":"28","author":"R. Strand","year":"2007","unstructured":"Strand, R.: Weighted distances based on neighbourhood sequences. Pattern Recognition Letters\u00a028(15), 2029\u20132036 (2007)","journal-title":"Pattern Recognition Letters"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-540-73040-8_46","volume-title":"Image Analysis","author":"R. Strand","year":"2007","unstructured":"Strand, R.: Weighted distances based on neighbourhood sequences in non-standard three-dimensional grids. In: Ersb\u00f8ll, B.K., Pedersen, K.S. (eds.) SCIA 2007. LNCS, vol.\u00a04522, pp. 452\u2013461. Springer, Heidelberg (2007)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-3-540-78275-9_5","volume-title":"IWCIA 2008","author":"R. Strand","year":"2008","unstructured":"Strand, R., Nagy, B.: Weighted neighbourhood sequences in non-standard three-dimensional grids \u2013 parameter optimization. In: Brimkov, V.E., Barneva, R.P., Hauptman, H. (eds.) IWCIA 2008. LNCS, vol.\u00a04958, pp. 51\u201362. Springer, Heidelberg (2008)"},{"key":"19_CR20","series-title":"The Morgan Kaufmann Series in Computer Graphics","volume-title":"Digital geometry: Geometric methods for digital image analysis","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital geometry: Geometric methods for digital image analysis. The Morgan Kaufmann Series in Computer Graphics. Morgan Kaufmann, San Francisco (2004)"},{"issue":"6","key":"19_CR21","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/0031-3203(87)90030-6","volume":"20","author":"J. Piper","year":"1987","unstructured":"Piper, J., Granum, E.: Computing distance transformations in convex and non-convex domains. Pattern Recognition\u00a020(6), 599\u2013615 (1987)","journal-title":"Pattern Recognition"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Strand, R.: Shape representation with maximal path-points for path-based distances. In: Petrou, M., Saram\u00e4ki, T., Er\u00e7il, A., Loncaric, S. (eds.) ISPA 2007, pp. 397\u2013402 (2007)","DOI":"10.1109\/ISPA.2007.4383726"}],"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_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T13:19:38Z","timestamp":1684329578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79126-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540791256","9783540791263"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79126-3_19","relation":{},"subject":[]}}