{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:10:16Z","timestamp":1776679816909,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10878-019-00425-x","type":"journal-article","created":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:30:09Z","timestamp":1559370609000},"page":"867-886","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3292-119X","authenticated-orcid":false,"given":"Gergely","family":"Kov\u00e1cs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedek","family":"Nagy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B\u00e9la","family":"Vizv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"key":"425_CR1","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 (1986) Distance transformations in digital images. Comput Vis Graph Image Process 34:344\u2013371","journal-title":"Comput Vis Graph Image Process"},{"issue":"6","key":"425_CR2","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1109\/34.9107","volume":"10","author":"G Borgefors","year":"1988","unstructured":"Borgefors G (1988) Hierarchical chamfer matching: a parametric edge matching algorithm. IEEE Trans Pattern Anal Mach Intell 10(6):849\u2013865","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"425_CR3","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1145\/361573.361583","volume":"15","author":"ES Deutsch","year":"1972","unstructured":"Deutsch ES (1972) Thinning algorithms on rectangular, hexagonal and triangular arrays. Commun ACM 15:827\u2013837","journal-title":"Commun ACM"},{"key":"425_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269\u2013271","journal-title":"Numerische Mathematik"},{"key":"425_CR5","unstructured":"Forchhammer S (1989) Euclidean distances from chamfer distances for limited distances. In: Proceedings of Sixth Scandinavian Conference on Image Analysis (SCIA\u201989), Oulu, Finland, pp 393\u2013400"},{"key":"425_CR6","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1109\/83.413166","volume":"4","author":"I Her","year":"1995","unstructured":"Her I (1995) Geometric transformations on the hexagonal grid. IEEE Trans Image Proc 4:1213\u20131221","journal-title":"IEEE Trans Image Proc"},{"key":"425_CR7","volume-title":"Digital geometry. Geometric methods for digital picture analysis","author":"R Klette","year":"2004","unstructured":"Klette R, Rosenfeld A (2004) Digital geometry. Geometric methods for digital picture analysis. Morgan Kaufmann Publishers, San Francisco"},{"key":"425_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s10851-016-0701-5","volume":"59","author":"G Kov\u00e1cs","year":"2017","unstructured":"Kov\u00e1cs G, Nagy B, Vizv\u00e1ri B (2017) Weighted distances and digital disks on the Khalimsky grid: disks with holes and islands. J Math Imaging Vis 59:2\u201322","journal-title":"J Math Imaging Vis"},{"key":"425_CR9","unstructured":"Leyzorek M, Gray RS, Johnson AA, Ladew WC, Meaker SR, Petry RM, Seitz RN (1957) Investigation of model techniques. First Annual Report, 6 June 1956\u20131 July 1957, A Study of Model Techniques for Communication Systems, Cleveland, Ohio, Case Institute of Technology"},{"key":"425_CR10","doi-asserted-by":"crossref","unstructured":"Luczak E, Rosenfeld A (1976) Distance on a hexagonal grid. IEEE Trans Comput C-25(5):532\u2013533","DOI":"10.1109\/TC.1976.1674642"},{"key":"425_CR11","volume-title":"Operations research\u2014deterministic optimization models","author":"KG Murty","year":"1995","unstructured":"Murty KG (1995) Operations research\u2014deterministic optimization models. Prentice-Hall, Upper Saddle River"},{"key":"425_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01254101","volume":"4","author":"P Nacken","year":"1994","unstructured":"Nacken P (1994) Chamfer metrics in mathematical morphology. J Math Imaging Vis 4:233\u2013253","journal-title":"J Math Imaging Vis"},{"key":"425_CR13","doi-asserted-by":"crossref","first-page":"483","DOI":"10.5486\/PMD.2003.2875","volume":"63","author":"B Nagy","year":"2003","unstructured":"Nagy B (2003a) Distance functions based on neighbourhood sequences. Publicationes Mathematicae Debrecen 63:483\u2013493","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"425_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.2498\/cit.2003.02.04","volume":"11","author":"B Nagy","year":"2003","unstructured":"Nagy B (2003b) Shortest path in triangular grids with neighbourhood sequences. J Comput Inf Technol 11:111\u2013122","journal-title":"J Comput Inf Technol"},{"key":"425_CR15","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1016\/j.patrec.2004.04.001","volume":"25","author":"B Nagy","year":"2004","unstructured":"Nagy B (2004) Characterization of digital circles in triangular grid. Pattern Recognit Lett 25:1231\u20131242","journal-title":"Pattern Recognit Lett"},{"key":"425_CR16","unstructured":"Nagy B (2007a) Digital geometry of various grids based on neighbourhood structures. In: Proceedings of 6th conference of Hungarian association for image processing and pattern recognition (KEPAF 2007), Debrecen, Hungary, pp 46\u201353"},{"key":"425_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.patrec.2006.06.007","volume":"28","author":"B Nagy","year":"2007","unstructured":"Nagy B (2007b) Distances with neighbourhood sequences in cubic and triangular grids. Pattern Recognit Lett 28:99\u2013109","journal-title":"Pattern Recognit Lett"},{"key":"425_CR18","doi-asserted-by":"publisher","first-page":"2344","DOI":"10.1016\/j.dam.2007.10.017","volume":"156","author":"B Nagy","year":"2008","unstructured":"Nagy B (2008) Distance with generalised neighbourhood sequences in $$n\\text{ D }$$ and $$\\infty \\text{ D }$$. Discrete Appl Math 156:2344\u20132351","journal-title":"Discrete Appl Math"},{"key":"425_CR19","doi-asserted-by":"crossref","unstructured":"Nagy B (2009) Isometric transformations of the dual of the hexagonal lattice. In: Proceedings of 6th international symposium on image and signal processing and analysis (ISPA 2009), Salzburg, Austria, pp 432\u2013437","DOI":"10.1109\/ISPA.2009.5297709"},{"key":"425_CR20","doi-asserted-by":"crossref","unstructured":"Nagy B (2014) Weighted distances on a triangular grid. In: Combinatorial image analysis (IWCIA 2014), LNCS 8466, pp 37\u201350","DOI":"10.1007\/978-3-319-07148-0_5"},{"key":"425_CR21","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.dam.2015.10.034","volume":"216","author":"B Nagy","year":"2017","unstructured":"Nagy B (2017) Application of neighborhood sequences in communication of hexagonal networks. Discrete Appl Math 216:424\u2013440","journal-title":"Discrete Appl Math"},{"key":"425_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF02018666","volume":"2","author":"A Pr\u00e9kopa","year":"1972","unstructured":"Pr\u00e9kopa A (1972) On the number of vertices of random convex polyhedra. Periodica Math Hung 2:259\u2013282","journal-title":"Periodica Math Hung"},{"key":"425_CR23","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 JL (1968) Distance functions on digital pictures. Pattern Recognit 1:33\u201361","journal-title":"Pattern Recognit"},{"key":"425_CR24","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.dam.2008.08.019","volume":"157","author":"R Strand","year":"2009","unstructured":"Strand R (2009) Weighted distances based on neighborhood sequences for point-lattices. Discrete Appl Math 157:641\u2013652","journal-title":"Discrete Appl Math"},{"key":"425_CR25","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1016\/S0167-8655(02)00101-0","volume":"23","author":"S Svensson","year":"2002","unstructured":"Svensson S, Borgefors G (2002) Distance transforms in 3D using four different weights. Pattern Recognit Lett 23:1407\u20131418","journal-title":"Pattern Recognit Lett"},{"key":"425_CR26","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 (1986) Distances defined by neighborhood sequences. Pattern Recognit 19:237\u2013246","journal-title":"Pattern Recognit"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00425-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00425-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00425-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T03:38:18Z","timestamp":1694921898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00425-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,1]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00425-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,1]]},"assertion":[{"value":"1 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}