{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:03:57Z","timestamp":1760709837224,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14085-4_31","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"397-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid"],"prefix":"10.1007","author":[{"given":"Lidija","family":"\u010comi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0262-8856(89)90044-9","volume":"7","author":"SBM Bell","year":"1989","unstructured":"Bell, S.B.M., Holroyd, F.C., Mason, D.C.: A digital geometry for hexagonal pixels. Image Vis. Comput. 7(3), 194\u2013204 (1989)","journal-title":"Image Vis. Comput."},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0167-8655(89)90042-1","volume":"9","author":"G Borgefors","year":"1989","unstructured":"Borgefors, G.: Distance transformations on hexagonal grids. Pattern Recogn. Lett. 9(2), 97\u2013105 (1989)","journal-title":"Pattern Recogn. Lett."},{"key":"31_CR3","unstructured":"Borgefors, G., Sanniti di Baja, G.: Skeletonizing the distance transform on the hexagonal grid. In: 9th International Conference on Pattern Recognition, ICPR, pp. 504\u2013507 (1988)"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0031-3203(98)00132-0","volume":"32","author":"E Bribiesca","year":"1999","unstructured":"Bribiesca, E.: A new chain code. Pattern Recogn. 32(2), 235\u2013251 (1999)","journal-title":"Pattern Recogn."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1093\/comjnl\/bxh075","volume":"48","author":"VE Brimkov","year":"2005","unstructured":"Brimkov, V.E., Barneva, R.P.: Analytical honeycomb geometry for raster and volume graphics. Comput. J. 48, 180\u2013199 (2005)","journal-title":"Comput. J."},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11774938_2","volume-title":"Combinatorial Image Analysis","author":"VE Brimkov","year":"2006","unstructured":"Brimkov, V.E., Maimone, A., Nordo, G.: Counting gaps in binary pictures. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol. 4040, pp. 16\u201324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11774938_2"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11595755_5","volume-title":"Advances in Visual Computing","author":"VE Brimkov","year":"2005","unstructured":"Brimkov, V.E., Maimone, A., Nordo, G., Barneva, R.P., Klette, R.: The number of gaps in binary pictures. In: Bebis, G., Boyle, R., Koracin, D., Parvin, B. (eds.) ISVC 2005. LNCS, vol. 3804, pp. 35\u201342. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11595755_5"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11505877_17","volume-title":"Developments in Language Theory","author":"S Brlek","year":"2005","unstructured":"Brlek, S., Labelle, G., Lacasse, A.: A note on a result of Daurat and Nivat. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 189\u2013198. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11505877_17"},{"issue":"3","key":"31_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1142\/S012905410600398X","volume":"17","author":"S Brlek","year":"2006","unstructured":"Brlek, S., Labelle, G., Lacasse, A.: Properties of the contour path of discrete sets. Int. J. Found. Comput. Sci. 17(3), 543\u2013556 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"31_CR10","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.dam.2008.05.026","volume":"157","author":"S Brlek","year":"2009","unstructured":"Brlek, S., Proven\u00e7al, X., Fedou, J.: On the tiling by translation problem. Discrete Appl. Math. 157(3), 464\u2013475 (2009)","journal-title":"Discrete Appl. Math."},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-030-10828-1_5","volume-title":"Computational Topology in Image Context","author":"L \u010comi\u0107","year":"2019","unstructured":"\u010comi\u0107, L.: Gaps and well-composed objects in the triangular grid. In: Marfil, R., Calder\u00f3n, M., D\u00edaz del R\u00edo, F., Real, P., Bandera, A. (eds.) CTIC 2019. LNCS, vol. 11382, pp. 54\u201367. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10828-1_5"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/S1571-0653(04)00487-1","volume":"12","author":"A Daurat","year":"2003","unstructured":"Daurat, A., Nivat, M.: Salient and reentrant points of discrete sets. Electron. Notes Discrete Math. 12, 208\u2013219 (2003)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1\u20133","key":"31_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2005.02.024","volume":"151","author":"A Daurat","year":"2005","unstructured":"Daurat, A., Nivat, M.: Salient and reentrant points of discrete sets. Discrete Appl. Math. 151(1\u20133), 106\u2013121 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"31_CR14","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1109\/T-C.1970.222808","volume":"19","author":"ES Deutsch","year":"1970","unstructured":"Deutsch, E.S.: On parallel operations on hexagonal arrays. IEEE Trans. Comput. 19(10), 982\u2013983 (1970)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"31_CR15","doi-asserted-by":"publisher","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. Commun. ACM 15(9), 827\u2013837 (1972)","journal-title":"Commun. ACM"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.patrec.2018.01.009","volume":"103","author":"M Dutt","year":"2018","unstructured":"Dutt, M., Andres, E., Largeteau-Skapin, G.: Characterization and generation of straight line segments on triangular cell grid. Pattern Recogn. Lett. 103, 68\u201374 (2018)","journal-title":"Pattern Recogn. Lett."},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-26145-4_9","volume-title":"Combinatorial Image Analysis","author":"M Dutt","year":"2015","unstructured":"Dutt, M., Biswas, A., Nagy, B.: Number of shortest paths in triangular grid for 1- and 2-neighborhoods. In: Barneva, R.P., Bhattacharya, B.B., Brimkov, V.E. (eds.) IWCIA 2015. LNCS, vol. 9448, pp. 115\u2013124. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26145-4_9"},{"issue":"2\u20133","key":"31_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF00119834","volume":"6","author":"AV Evako","year":"1996","unstructured":"Evako, A.V., Kopperman, R., Mukhin, Y.V.: Dimensional properties of graphs and digital spaces. J. Math. Imaging Vis. 6(2\u20133), 109\u2013119 (1996)","journal-title":"J. Math. Imaging Vis."},{"issue":"1","key":"31_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/356625.356627","volume":"6","author":"H Freeman","year":"1974","unstructured":"Freeman, H.: Computer processing of line-drawing images. ACM Comput. Surv. 6(1), 57\u201397 (1974)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"31_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TC.1979.1675305","volume":"28","author":"H Freeman","year":"1979","unstructured":"Freeman, H.: Algorithm for generating a digital straight line on a triangular grid. IEEE Trans. Comput. 28(2), 150\u2013152 (1979)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"31_CR21","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/T-C.1969.222756","volume":"18","author":"MJE Golay","year":"1969","unstructured":"Golay, M.J.E.: Hexagonal parallel pattern transformations. IEEE Trans. Comput. 18(8), 733\u2013740 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/T-C.1971.223289","volume":"20","author":"S Gray","year":"1971","unstructured":"Gray, S.: Local properties of binary images in two dimensions. IEEE Trans. Comput. 20, 551\u2013561 (1971)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"31_CR23","doi-asserted-by":"publisher","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 Process. 4(9), 1213\u20131222 (1995)","journal-title":"IEEE Trans. Image Process."},{"issue":"1\u20132","key":"31_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10472-014-9426-6","volume":"75","author":"P Kardos","year":"2015","unstructured":"Kardos, P., Pal\u00e1gyi, K.: Topology preservation on the triangular grid. Ann. Math. Artif. Intell. 75(1\u20132), 53\u201368 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.dam.2015.10.033","volume":"216","author":"P Kardos","year":"2017","unstructured":"Kardos, P., Pal\u00e1gyi, K.: On topology preservation of mixed operators in triangular, square, and hexagonal grids. Discrete Appl. Math. 216, 441\u2013448 (2017)","journal-title":"Discrete Appl. Math."},{"key":"31_CR26","volume-title":"Digital Geometry. Geometric Methods for Digital Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry. Geometric Methods for Digital Picture Analysis. Morgan Kaufmann Publishers, San Francisco, Amsterdam (2004)"},{"issue":"1","key":"31_CR27","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1006\/cviu.1995.1006","volume":"61","author":"LJ Latecki","year":"1995","unstructured":"Latecki, L.J., Eckhardt, U., Rosenfeld, A.: Well-composed sets. Comput. Vis. Image Underst. 61(1), 70\u201383 (1995)","journal-title":"Comput. Vis. Image Underst."},{"issue":"1\u20132","key":"31_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10472-014-9404-z","volume":"75","author":"B Nagy","year":"2015","unstructured":"Nagy, B.: Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids. Ann. Math. Artif. Intell. 75(1\u20132), 117\u2013134 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"31_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.3233\/FI-2016-1350","volume":"145","author":"B Nagy","year":"2016","unstructured":"Nagy, B., Luki\u0107, T.: Dense projection tomography on the triangular tiling. Fundam. Inform. 145(2), 125\u2013141 (2016)","journal-title":"Fundam. Inform."},{"issue":"15","key":"31_CR30","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 412(15), 1364\u20131377 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR31","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.dam.2016.01.014","volume":"216","author":"A Sarkar","year":"2017","unstructured":"Sarkar, A., Biswas, A., Dutt, M., Bhowmick, P., Bhattacharya, B.B.: A linear-time algorithm to compute the triangular hull of a digital object. Discrete Appl. Math. 216, 408\u2013423 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"31_CR32","doi-asserted-by":"publisher","first-page":"297","DOI":"10.3233\/FI-2018-1666","volume":"159","author":"A Sarkar","year":"2018","unstructured":"Sarkar, A., Biswas, A., Dutt, M., Mondal, S.: Finding shortest triangular path and its family inside a digital object. Fundam. Inform. 159(3), 297\u2013325 (2018)","journal-title":"Fundam. Inform."},{"key":"31_CR33","first-page":"340","volume":"8","author":"JH Sossa-Azuela","year":"2010","unstructured":"Sossa-Azuela, J.H., Cuevas-Jim\u00e9nez, E.V., Zaldivar-Navarro, D.: Computation of the Euler number of a binary image composed of hexagonal cells. J. Appl. Res. Technol. 8, 340\u2013350 (2010)","journal-title":"J. Appl. Res. Technol."},{"key":"31_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-78275-9_2","volume-title":"Combinatorial Image Analysis","author":"P Wiederhold","year":"2008","unstructured":"Wiederhold, P., Morales, S.: Thinning on quadratic, triangular, and hexagonal cell complexes. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds.) IWCIA 2008. LNCS, vol. 4958, pp. 13\u201325. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78275-9_2"},{"issue":"9\u201310","key":"31_CR35","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1016\/S0167-8655(02)00334-3","volume":"24","author":"B Yip","year":"2003","unstructured":"Yip, B., Klette, R.: Angle counts for isothetic polygons and polyhedra. Pattern Recogn. Lett. 24(9\u201310), 1275\u20131278 (2003)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:09:50Z","timestamp":1679188190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}