{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:26:40Z","timestamp":1763468800245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031198960"},{"type":"electronic","value":"9783031198977"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19897-7_8","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T17:14:33Z","timestamp":1666286073000},"page":"84-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Algorithms for\u00a0Pixelwise Shape Deformations Preserving Digital Convexity"],"prefix":"10.1007","author":[{"given":"Lama","family":"Tarsissi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukiko","family":"Kenmochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadjer","family":"Djerroumi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Coeurjolly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Romon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Pierre","family":"Borel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/0097-3165(95)90058-6","volume":"69","author":"DM Acketa","year":"1995","unstructured":"Acketa, D.M., \u017duni\u0107, J.: On the maximal number of edges of convex digital polygons included into an m x m-grid. J. Comb. Theor. Ser. A 69, 358\u2013368 (1995)","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/321623.321634","volume":"18","author":"JC Alexander","year":"1971","unstructured":"Alexander, J.C., Thaler, A.I.: The boundary count of digital pictures. J. ACM 18(1), 105\u2013112 (1971)","journal-title":"J. ACM"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1090\/S0002-9947-1963-0143105-7","volume":"106","author":"G Andrews","year":"1963","unstructured":"Andrews, G.: A lower bound for the volume of strictly convex bodies with many boundary lattice points. Trans. Am. Math. Soc. 106, 270\u2013279 (1963)","journal-title":"Trans. Am. Math. Soc."},{"key":"8_CR4","unstructured":"Berstel, J.: Trac\u00e9 de droites, fractions continues et morphismes it\u00e9r\u00e9s. In: Mots, pp. 298\u2013309. Herm\u00e8s (1990)"},{"issue":"1","key":"8_CR5","first-page":"23","volume":"5","author":"JP Borel","year":"1993","unstructured":"Borel, J.P., Laubie, F.: Quelques mots sur la droite projective r\u00e9elle. J. de Th\u00e9orie des Nombres de Bordeaux 5(1), 23\u201351 (1993)","journal-title":"J. de Th\u00e9orie des Nombres de Bordeaux"},{"key":"8_CR6","unstructured":"Borel, J.P., Laubie, F.: Construction de mots de Christoffel. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences. S\u00e9rie I. Math\u00e9matique 313(8), 483\u2013485 (1991)"},{"issue":"10","key":"8_CR7","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1016\/j.patcog.2008.11.010","volume":"42","author":"S Brlek","year":"2009","unstructured":"Brlek, S., Lachaud, J.O., Proven\u00e7al, X., Reutenauer, C.: Lyndon + christoffel = digitally convex. Pattern Recogn. 42(10), 2239\u20132246 (2009)","journal-title":"Pattern Recogn."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, iv. the quotient groups of the lower central series. Ann. Math. 68(1), 81\u201395 (1958)","DOI":"10.2307\/1970044"},{"key":"8_CR9","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-030-76657-3_11","volume-title":"Discrete Geometry and Mathematical Morphology","author":"L Crombez","year":"2021","unstructured":"Crombez, L.: Digital convex + unimodular mapping = 8-connected (all points but one 4-connected). In: Lindblad, J., Malmberg, F., Sladoje, N. (eds.) DGMM 2021. LNCS, vol. 12708, pp. 164\u2013176. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76657-3_11"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-66396-8_16","volume-title":"Combinatorics on Words","author":"P Dulio","year":"2017","unstructured":"Dulio, P., Frosini, A., Rinaldi, S., Tarsissi, L., Vuillon, L.: First steps in the algorithmic reconstruction of digital convex sets. In: Brlek, S., Dolce, F., Reutenauer, C., Vandomme, \u00c9. (eds.) WORDS 2017. LNCS, vol. 10432, pp. 164\u2013176. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66396-8_16"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"JP Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"8_CR13","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). https:\/\/doi.org\/10.1007\/3-540-45576-0_13"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Freeman, H.: On the Encoding of Arbitrary Geometric Configurations. IRE Trans. Electron. Comput. EC-10(2), 260\u2013268 (1961)","DOI":"10.1109\/TEC.1961.5219197"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kim, C.E.: On the Cellular Convexity of Complexes. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-3(6), 617\u2013625 (1981)","DOI":"10.1109\/TPAMI.1981.4767162"},{"issue":"3","key":"8_CR16","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. Vision Graph. Image Process. 48(3), 357\u2013393 (1989)","journal-title":"Comput. Vision Graph. Image Process."},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Lachaud, J.-O.: An alternative definition for digital convexity. J. Math. Imaging Vision , 1\u201318 (2022). https:\/\/doi.org\/10.1007\/s10851-022-01076-0","DOI":"10.1007\/s10851-022-01076-0"},{"key":"8_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press, Cambridge (2002)"},{"issue":"2","key":"8_CR19","first-page":"202","volume":"77","author":"RC Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On burnside\u2019s problem. Trans. Am. Math. Soc. 77(2), 202\u2013215 (1954)","journal-title":"Trans. Am. Math. Soc."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-09955-2_13","volume-title":"Discrete Geometry for Computer Imagery","author":"T Roussillon","year":"2014","unstructured":"Roussillon, T.: An arithmetical characterization of the convex hull of digital straight segments. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds.) DGCI 2014. LNCS, vol. 8668, pp. 150\u2013161. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09955-2_13"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-030-41299-9_48","volume-title":"Pattern Recognition","author":"L Tarsissi","year":"2020","unstructured":"Tarsissi, L., Coeurjolly, D., Kenmochi, Y., Romon, P.: Convexity preserving contraction of digital sets. In: Palaiahnakote, S., Sanniti di Baja, G., Wang, L., Yan, W.Q. (eds.) ACPR 2019. LNCS, vol. 12047, pp. 611\u2013624. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41299-9_48"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Tarsissi, L., Kenmochi, Y., Romon, P., Coeurjolly, D., Borel, J.P.: Convexity preserving deformations of digital sets: characterization of removable and insertable points. Technical report, LIGM (2022)","DOI":"10.2139\/ssrn.4341925"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry and Mathematical Morphology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19897-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T09:31:51Z","timestamp":1678354311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19897-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031198960","9783031198977"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19897-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry and Mathematical Morphology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Strasbourg","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgmm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgmm2022.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":"45","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":"33","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":"73% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}