{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T02:26:58Z","timestamp":1768616818960,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319591070","type":"print"},{"value":"9783319591087","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59108-7_5","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T08:43:06Z","timestamp":1494924186000},"page":"53-65","source":"Crossref","is-referenced-by-count":9,"title":["On the Chamfer Polygons on the Triangular Grid"],"prefix":"10.1007","author":[{"given":"Hamid","family":"Mir-Mohammad-Sadeghi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedek","family":"Nagy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0734-189X(84)90035-5","volume":"27","author":"G Borgefors","year":"1984","unstructured":"Borgefors, G.: Distance transformations in arbitrary dimensions. Comput. Vis. Gr. Image Process. 27(3), 321\u2013345 (1984)","journal-title":"Comput. Vis. Gr. Image Process."},{"issue":"3","key":"5_CR2","doi-asserted-by":"crossref","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. Comput. Vis. Graph. Image Process. 34(3), 344\u2013371 (1986)","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"10","key":"5_CR3","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1109\/83.718487","volume":"7","author":"MA Butt","year":"1998","unstructured":"Butt, M.A., Maragos, P.: Optimum design of chamfer distance transforms. IEEE Trans. Image Process. 7(10), 1477\u20131484 (1998)","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"5_CR4","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.patcog.2010.08.028","volume":"44","author":"ME Celebi","year":"2011","unstructured":"Celebi, M.E., Celiker, F., Kingravi, H.A.: On Euclidean norm approximations. Pattern Recogn. 44(2), 278\u2013283 (2011)","journal-title":"Pattern Recogn."},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0255(87)90015-6","volume":"42","author":"PP Das","year":"1987","unstructured":"Das, P.P., Chakrabarti, P.P., Chatterji, B.N.: Generalised distances in digital geometry. Inform. Sci. 42, 51\u201367 (1987)","journal-title":"Inform. Sci."},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0255(90)90008-X","volume":"50","author":"PP Das","year":"1990","unstructured":"Das, P.P., Chatterji, B.N.: Octagonal distances for digital pictures. Inform. Sci. 50, 123\u2013150 (1990)","journal-title":"Inform. Sci."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1145\/361573.361583","volume":"15","author":"ES Deutsch","year":"1972","unstructured":"Deutsch, E.S.: Thinning algorithms on rectangular, hexagonal and triangular arrays. Comm. ACM 15, 827\u2013837 (1972)","journal-title":"Comm. ACM"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-45576-0_13","volume-title":"Digital and Image Geometry","author":"U Eckhardt","year":"2001","unstructured":"Eckhardt, U.: Digital lines and digital convexity. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol. 2243, pp. 209\u2013228. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45576-0_13"},{"key":"5_CR9","unstructured":"Farkas, J., Baj\u00e1k, Sz., Nagy, B.: Notes on approximating the Euclidean circle in square grids. Pure Math. Appl. - PU.M.A. 17, 309\u2013322 (2006)"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1109\/83.413166","volume":"4","author":"I Her","year":"1995","unstructured":"Her, I.: Geometric transformations on the hexagonal grid. IEEE Trans. Image Proc. 4, 1213\u20131221 (1995)","journal-title":"IEEE Trans. Image Proc."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Klette, R., Rosenfeld, A.: Digital geometry. Geometric methods for digital picture analysis. Morgan Kaufmann Publishers, Elsevier Science B.V. (2004)","DOI":"10.1016\/B978-155860861-0\/50005-5"},{"issue":"5","key":"5_CR12","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/TC.1976.1674642","volume":"C\u201325","author":"E Luczak","year":"1976","unstructured":"Luczak, E., Rosenfeld, A.: Distance on a hexagonal grid. Trans. Comput. C\u201325(5), 532\u2013533 (1976)","journal-title":"Trans. Comput."},{"key":"5_CR13","volume-title":"Hexagonal Image Processing: A Practical Approach","author":"L Middleton","year":"2005","unstructured":"Middleton, L., Sivaswamy, J.: Hexagonal Image Processing: A Practical Approach. Springer, London (2005)"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.patrec.2012.09.011","volume":"34","author":"J Mukherjee","year":"2013","unstructured":"Mukherjee, J.: Hyperspheres of weighted distances in arbitrary dimension. Pattern Recogn. Lett. 34, 117\u2013123 (2013)","journal-title":"Pattern Recogn. Lett."},{"key":"5_CR15","first-page":"259","volume":"13","author":"B Nagy","year":"2002","unstructured":"Nagy, B.: Metrics based on neighbourhood sequences in triangular grids. Pure Math. Appl. - PU.M.A. 13, 259\u2013274 (2002)","journal-title":"Pure Math. Appl. - PU.M.A."},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.2498\/cit.2003.02.04","volume":"11","author":"B Nagy","year":"2003","unstructured":"Nagy, B.: Shortest path in triangular grids with neighbourhood sequences. J. Comput. Inf. Technol. 11, 111\u2013122 (2003)","journal-title":"J. Comput. Inf. Technol."},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/j.patrec.2004.04.001","volume":"25","author":"B Nagy","year":"2004","unstructured":"Nagy, B.: Characterization of digital circles in triangular grid. Pattern Recogn. Lett. 25, 1231\u20131242 (2004)","journal-title":"Pattern Recogn. Lett."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/j.endm.2005.04.006","volume":"20","author":"B Nagy","year":"2005","unstructured":"Nagy, B.: An algorithm to find the number of the digitizations of discs with a fixed radius. Electron. Notes Discrete Math. 20, 607\u2013622 (2005)","journal-title":"Electron. Notes Discrete Math."},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"2344","DOI":"10.1016\/j.dam.2007.10.017","volume":"156","author":"B Nagy","year":"2008","unstructured":"Nagy, B.: Distance with generalized neighbourhood sequences in $$n$$ D and $$\\infty $$ D. Disc. Appl. Math. 156, 2344\u20132351 (2008)","journal-title":"Disc. Appl. Math."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Nagy, B.: Isometric transformations of the dual of the hexagonal lattice. In: ISPA 2009, Salzburg, Austria, pp. 432\u2013437 (2009)","DOI":"10.1109\/ISPA.2009.5297709"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-07148-0_5","volume-title":"Combinatorial Image Analysis","author":"B Nagy","year":"2014","unstructured":"Nagy, B.: Weighted distances on a triangular grid. In: Barneva, R.P., Brimkov, V.E., \u0160lapal, J. (eds.) IWCIA 2014. LNCS, vol. 8466, pp. 37\u201350. Springer, Cham (2014). doi: 10.1007\/978-3-319-07148-0_5"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-21073-0_19","volume-title":"Combinatorial Image Analysis","author":"B Nagy","year":"2011","unstructured":"Nagy, B., Barczi, K.: Isoperimetrically optimal polygons in the triangular grid. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 194\u2013207. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21073-0_19"},{"key":"5_CR23","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1080\/00207160.2012.737914","volume":"90","author":"B Nagy","year":"2013","unstructured":"Nagy, B., Barczi, K.: Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary. Int. J. Comput. Math. 90, 1629\u20131652 (2013)","journal-title":"Int. J. Comput. Math."},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-32360-2_30","volume-title":"Discrete Geometry for Computer Imagery","author":"B Nagy","year":"2016","unstructured":"Nagy, B., Mir-Mohammad-Sadeghi, H.: Digital disks by weighted distances in the triangular grid. In: Normand, N., Gu\u00e9don, J., Autrusseau, F. (eds.) DGCI 2016. LNCS, vol. 9647, pp. 385\u2013397. Springer, Cham (2016). doi: 10.1007\/978-3-319-32360-2_30"},{"key":"5_CR25","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1016\/j.tcs.2010.10.028","volume":"412","author":"B Nagy","year":"2011","unstructured":"Nagy, B., Strand, R.: Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid. Theoret. Comput. Sci. 412, 1364\u20131377 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-38294-9_25","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"B Nagy","year":"2013","unstructured":"Nagy, B., Strand, R., Normand, N.: A weight sequence distance function. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 292\u2013301. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38294-9_25"},{"key":"5_CR27","doi-asserted-by":"crossref","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 Recogn. 1, 33\u201361 (1968)","journal-title":"Pattern Recogn."},{"key":"5_CR28","first-page":"322","volume":"2001","author":"I-M Sintorn","year":"2001","unstructured":"Sintorn, I.-M., Borgefors, G.: Weighted distance transforms in rectangular grids. ICIAP 2001, 322\u2013326 (2001)","journal-title":"ICIAP"},{"key":"5_CR29","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/71.629486","volume":"8","author":"I Stojmenovic","year":"1997","unstructured":"Stojmenovic, I.: Honeycomb networks: topological properties and communication algorithms. IEEE Trans. Parallel Distrib. Syst. 8, 1036\u20131042 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1016\/S0167-8655(02)00101-0","volume":"23","author":"S Svensson","year":"2002","unstructured":"Svensson, S., Borgefors, G.: Distance transforms in 3D using four different weights. Pattern Recogn. Lett. 23, 1407\u20131418 (2002)","journal-title":"Pattern Recogn. Lett."},{"key":"5_CR31","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.tcs.2008.06.043","volume":"406","author":"D Vainsencher","year":"2008","unstructured":"Vainsencher, D., Bruckstein, A.M.: On isoperimetrically optimal polyforms. Theoret. Comput. Sci. 406, 146\u2013159 (2008)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59108-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T16:27:27Z","timestamp":1659025647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59108-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591070","9783319591087"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59108-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}