{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:47:38Z","timestamp":1742986058902,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031236112"},{"type":"electronic","value":"9783031236129"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-23612-9_3","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"46-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Number of\u00a00-Tandems in\u00a0Simple nD Digital 0-Connected Curves"],"prefix":"10.1007","author":[{"given":"Lidija","family":"\u010comi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"5","key":"3_CR1","first-page":"302","volume":"59","author":"E Andres","year":"1997","unstructured":"Andres, E., Acharya, R., Sibata, C.H.: Discrete analytical hyperplanes. CVGIP: Graph. Model Image Process. 59(5), 302\u2013309 (1997)","journal-title":"CVGIP: Graph. Model Image Process."},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10851-017-0769-6","volume":"60","author":"N Boutry","year":"2018","unstructured":"Boutry, N., G\u00e9raud, T., Najman, L.: A Tutorial on Well-Composedness. J. Math. Imaging Vis. 60(3), 443\u2013478 (2018). https:\/\/doi.org\/10.1007\/s10851-017-0769-6","journal-title":"J. Math. Imaging Vis."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.dam.2008.05.025","volume":"157","author":"VE Brimkov","year":"2009","unstructured":"Brimkov, V.E.: Formulas for the number of $$(n-2)$$-gaps of binary objects in arbitrary dimension. Discret. Appl. Math. 157(3), 452\u2013463 (2009)","journal-title":"Discret. Appl. Math."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-540-89639-5_64","volume-title":"Advances in Visual Computing","author":"VE Brimkov","year":"2008","unstructured":"Brimkov, V.E., Barneva, R.P.: Linear time constant-working space algorithm for computing the genus of a digital object. In: Bebis, G., et al. (eds.) ISVC 2008. LNCS, vol. 5358, pp. 669\u2013677. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89639-5_64"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-30503-3_21","volume-title":"Combinatorial Image Analysis","author":"VE Brimkov","year":"2004","unstructured":"Brimkov, V.E., Klette, R.: Curves, hypersurfaces, and good pairs of adjacency relations. In: Klette, R., \u017duni\u0107, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 276\u2013290. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30503-3_21"},{"key":"3_CR6","unstructured":"Brimkov, V.E., Maimone, A., Nordo, G.: An explicit formula for the number of tunnels in digital objects. CoRR abs\/cs\/0505084 (2005). http:\/\/arxiv.org\/abs\/cs\/0505084"},{"key":"3_CR7","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":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11907350_16","volume-title":"Discrete Geometry for Computer Imagery","author":"VE Brimkov","year":"2006","unstructured":"Brimkov, V.E., Moroni, D., Barneva, R.: Combinatorial relations for digital pictures. In: Kuba, A., Ny\u00fal, L.G., Pal\u00e1gyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 189\u2013198. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11907350_16"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0218654308001129","volume":"14","author":"VE Brimkov","year":"2008","unstructured":"Brimkov, V.E., Nordo, G., Barneva, R.P., Maimone, A.: Genus and dimension of digital images and their time- and space-efficient computation. Int. J. Shape Model. 14(2), 147\u2013168 (2008)","journal-title":"Int. J. Shape Model."},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/38.626973","volume":"17","author":"D Cohen-Or","year":"1997","unstructured":"Cohen-Or, D., Kaufman, A.E.: 3D line voxelization and connectivity control. IEEE Comput. Graph. Appl. 17(6), 80\u201387 (1997)","journal-title":"IEEE Comput. Graph. Appl."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-05288-1_1","volume-title":"Combinatorial Image Analysis","author":"L \u010comi\u0107","year":"2018","unstructured":"\u010comi\u0107, L.: On gaps in digital objects. In: Barneva, R.P., Brimkov, V.E., Tavares, J.M.R.S. (eds.) IWCIA 2018. LNCS, vol. 11255, pp. 3\u201316. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05288-1_1"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-62005-2_12","volume-title":"Discrete Geometry for Computer Imagery","author":"J Fran\u00e7on","year":"1996","unstructured":"Fran\u00e7on, J., Schramm, J.-M., Tajine, M.: Recognizing arithmetic straight lines and planes. In: Miguet, S., Montanvert, A., Ub\u00e9da, S. (eds.) DGCI 1996. LNCS, vol. 1176, pp. 139\u2013150. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-62005-2_12"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-39966-7_13","volume-title":"Discrete Geometry for Computer Imagery","author":"Y Kenmochi","year":"2003","unstructured":"Kenmochi, Y., Imiya, A.: Combinatorial topologies for discrete planes. In: Nystr\u00f6m, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886, pp. 144\u2013153. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39966-7_13"},{"key":"3_CR14","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":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0734-189X(89)90147-3","volume":"48","author":"TY Kong","year":"1989","unstructured":"Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vis. Graph. Image Process. 48(3), 357\u2013393 (1989)","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"3_CR16","volume-title":"Geometry of Locally Finite Spaces (Computer Agreeable Topology and Algorithms for Computer Imagery)","author":"VA Kovalevsky","year":"2008","unstructured":"Kovalevsky, V.A.: Geometry of Locally Finite Spaces (Computer Agreeable Topology and Algorithms for Computer Imagery). Editing House Dr. B\u00e4rbel Kovalevski, Berlin (2008)"},{"issue":"3","key":"3_CR17","first-page":"164","volume":"59","author":"LJ Latecki","year":"1997","unstructured":"Latecki, L.J.: 3D well-composed pictures. CVGIP: Graph. Model Image Process. 59(3), 164\u2013172 (1997)","journal-title":"CVGIP: Graph. Model Image Process."},{"issue":"1","key":"3_CR18","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":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.2298\/FIL1103085M","volume":"22","author":"A Maimone","year":"2011","unstructured":"Maimone, A., Nordo, G.: On 1-gaps in 3D digital objects. Filomat 22(3), 85\u201391 (2011)","journal-title":"Filomat"},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"547","DOI":"10.2298\/FIL1304547M","volume":"27","author":"A Maimone","year":"2013","unstructured":"Maimone, A., Nordo, G.: A formula for the number of $$(n-2)$$-gaps in digital $$n$$-objects. Filomat 27(4), 547\u2013557 (2013)","journal-title":"Filomat"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.18262\/ammp.2015.0101-08","volume":"1","author":"A Maimone","year":"2015","unstructured":"Maimone, A., Nordo, G.: 0-gaps on 3D digital curves. Appl. Math. Math. Phys. 1, 119\u2013128 (2015)","journal-title":"Appl. Math. Math. Phys."},{"issue":"5","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.2298\/FIL1705215M","volume":"31","author":"A Maimone","year":"2017","unstructured":"Maimone, A., Nordo, G.: A note on dimension and gaps in digital geometry. Filomat 31(5), 1215\u20131227 (2017)","journal-title":"Filomat"},{"key":"3_CR23","unstructured":"Nordo, G., Maimone, A.: 0-gaps on 3D digital curves. CoRR abs\/2109.13341 (2021)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Sossa, H.: On the number of holes of a 2-D binary object. In: 14th IAPR International Conference on Machine Vision Applications, MVA, pp. 299\u2013302 (2015)","DOI":"10.1109\/MVA.2015.7153190"},{"issue":"5","key":"3_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/38.156009","volume":"12","author":"R Yagel","year":"1992","unstructured":"Yagel, R., Cohen, D., Kaufman, A.E.: Discrete ray tracing. IEEE Comput. Graph. Appl. 12(5), 19\u201328 (1992)","journal-title":"IEEE Comput. Graph. Appl."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23612-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T03:33:51Z","timestamp":1672544031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23612-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031236112","9783031236129"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23612-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWCIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Image Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Messina","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","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":"iwcia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iwcia2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"24","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":"20","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":"83% - 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":"4","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)"}}]}}