{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:43:56Z","timestamp":1725471836584},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540476511"},{"type":"electronic","value":"9783540476528"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11907350_18","type":"book-chapter","created":{"date-parts":[[2006,10,12]],"date-time":"2006-10-12T11:58:22Z","timestamp":1160654302000},"page":"211-222","source":"Crossref","is-referenced-by-count":1,"title":["On the Lattice Structure of Subsets of Octagonal Neighborhood Sequences in \u2124n"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Hajdu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lajos","family":"Hajdu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/0167-8655(90)90099-N","volume":"11","author":"P.P. Das","year":"1990","unstructured":"Das, P.P.: Lattice of octagonal distances in digital geometry. Pattern Recognition Lett\u00a011, 663\u2013667 (1990)","journal-title":"Pattern Recognition Lett"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"405","DOI":"10.5486\/PMD.2002.2662","volume":"60","author":"A. Fazekas","year":"2002","unstructured":"Fazekas, A., Hajdu, A., Hajdu, L.: Lattice of generalized neighbourhood sequences in nD and \u221eD. Publ. Math. Debrecen.\u00a060, 405\u2013427 (2002)","journal-title":"Publ. Math. Debrecen."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1016\/j.patrec.2005.02.006","volume":"26","author":"A. Fazekas","year":"2005","unstructured":"Fazekas, A., Hajdu, A., Hajdu, L.: Metrical neighborhood sequences in $\\Bbb Z^n$ . Pattern Recognition Letters\u00a026, 2022\u20132032 (2005)","journal-title":"Pattern Recognition Letters"},{"key":"18_CR4","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"},{"key":"18_CR5","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., Chatterji, B.N.: Distance functions in digital geometry. Inform. Sci.\u00a042, 113\u2013136 (1987)","journal-title":"Inform. Sci."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0021-9045(92)90090-B","volume":"68","author":"P.P. Das","year":"1992","unstructured":"Das, P.P.: Best simple octagonal distances in digital geometry. J. Approx. Theory\u00a068, 155\u2013174 (1992)","journal-title":"J. Approx. Theory"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0255(87)90015-6","volume":"42","author":"P.P. Das","year":"1987","unstructured":"Das, P.P., Chakrabarti, P.P., Chatterji, B.N.: Generalised distances in digital geometry. Inform. Sci.\u00a042, 51\u201367 (1987)","journal-title":"Inform. Sci."},{"key":"18_CR8","first-page":"55","volume":"15","author":"A. Fazekas","year":"1999","unstructured":"Fazekas, A.: Lattice of distances based on 3D-neighbourhood sequences. Acta. Math. Acad. Paedagog. Nyh\u00e1zi. (N.S.)\u00a015, 55\u201360 (1999)","journal-title":"Acta. Math. Acad. Paedagog. Nyh\u00e1zi. (N.S.)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.disc.2003.12.016","volume":"283","author":"A. Hajdu","year":"2004","unstructured":"Hajdu, A., Hajdu, L.: Approximating the Euclidean distance by digital metrics. Discrete Math.\u00a0283, 101\u2013111 (2004)","journal-title":"Discrete Math."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/S0167-8655(00)00022-2","volume":"21","author":"J. Mukherjee","year":"2000","unstructured":"Mukherjee, J., Das, P.P., Aswatha Kumar, M., Chatterji, B.N.: On approximating Euclidean metrics by digital distances in 2D and 3D. Pattern Recognition Lett.\u00a021, 573\u2013582 (2000)","journal-title":"Pattern Recognition Lett."},{"key":"18_CR11","unstructured":"Hajdu, A., Hajdu, L., Tijdeman, R.: General neighbourhood sequences in ${\\Bbb Z}^n$ . Disc. Appl. Math. (to appear)"},{"key":"18_CR12","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading, xix+238 p. (1983)"},{"key":"18_CR13","first-page":"133","volume":"16","author":"A. Hajdu","year":"2003","unstructured":"Hajdu, A., Hajdu, L.: Velocity and distance of neighbourhood sequences. Acta Cybernet\u00a016, 133\u2013145 (2003)","journal-title":"Acta Cybernet"},{"key":"18_CR14","first-page":"1","volume":"109","author":"M. Nivat","year":"1979","unstructured":"Nivat, M.: Infinite words, infinite trees, infinite computations. Math. Centre Tracts\u00a0109, 1\u201352 (1979)","journal-title":"Math. Centre Tracts"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)90016-7","volume":"50","author":"R. Siromoney","year":"1994","unstructured":"Siromoney, R., Mathew, R., Dare, V.R., Subramanian, K.G.: Infinite Lyndon words. Inf. Proc. Letters\u00a050, 101\u2013104 (1994)","journal-title":"Inf. Proc. Letters"},{"key":"18_CR16","first-page":"21","volume":"31","author":"J.L. Yucas","year":"1991","unstructured":"Yucas, J.L.: Counting special sets of binary Lyndon words. Ars Combinatoria\u00a031, 21\u201329 (1991)","journal-title":"Ars Combinatoria"},{"key":"18_CR17","unstructured":"Nagy, B.: Distance functions based on generalised neighbourhood sequences in finite and infinite dimensional spaces. In: Kov\u00e1cs, E., Winkler, Z. (eds.) Fifth International Conference on Applied Informatics, Eger, Hungary, pp. 183\u2013190 (2001)"},{"key":"18_CR18","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. Publ. Math. Debrecen\u00a063, 483\u2013493 (2003)","journal-title":"Publ. Math. Debrecen"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11907350_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T09:33:50Z","timestamp":1683624830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11907350_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540476511","9783540476528"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11907350_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}