{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T21:48:28Z","timestamp":1726177708167},"publisher-location":"Cham","reference-count":15,"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_9","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T17:14:33Z","timestamp":1666286073000},"page":"98-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Full Convexity for\u00a0Polyhedral Models in\u00a0Digital Spaces"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-5178-0842","authenticated-orcid":false,"given":"Fabien","family":"Feschet","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4236-2133","authenticated-orcid":false,"given":"Jacques-Olivier","family":"Lachaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1016\/j.disc.2006.04.034","volume":"306","author":"K Ando","year":"2006","unstructured":"Ando, K.: Extreme points axioms for closure spaces. Discret. Math. 306, 3181\u20133188 (2006)","journal-title":"Discret. Math."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(01)00061-5","volume":"283","author":"VE Brimkov","year":"2002","unstructured":"Brimkov, V.E., Barneva, R.P.: Graceful planes and lines. Theoret. Comput. Sci. 283(1), 151\u2013170 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"CB Barber","year":"1996","unstructured":"Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469\u2013483 (1996)","journal-title":"ACM Trans. Math. Softw."},{"key":"9_CR4","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":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-30503-3_32","volume-title":"Combinatorial Image Analysis","author":"CO Kiselman","year":"2004","unstructured":"Kiselman, C.O.: Convex functions on discrete sets. In: Klette, R., \u017duni\u0107, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 443\u2013457. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30503-3_32"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1109\/TPAMI.1982.4767314","volume":"6","author":"CE Kim","year":"1982","unstructured":"Kim, C.E., Rosenfeld, A.: Convex digital solids. IEEE Trans. Pattern Anal. Mach. Intel. 6, 612\u2013618 (1982)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/TPAMI.1982.4767221","volume":"2","author":"CE Kim","year":"1982","unstructured":"Kim, C.E., Rosenfeld, A.: Digital straight lines and convexity of digital regions. IEEE Trans. Pattern Anal. Mach. Intel. 2, 149\u2013153 (1982)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Lachaud, J.-O.: An alternative definition for digital convexity. In: Lindblad, J., Malmberg, F., Sladoje, N. (eds.) DGMM 2021. LNCS, vol. 12708, pp. 269\u2013282. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76657-3_19","DOI":"10.1007\/978-3-030-76657-3_19"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Lachaud, J.-O.: An alternative definition for digital convexity. J. Math. Imaging Vis. (2022). (To appear)","DOI":"10.1007\/s10851-022-01076-0"},{"key":"9_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36023-9","volume-title":"Function Algebras on Finite Sets","author":"D Lau","year":"2006","unstructured":"Lau, D.: Function Algebras on Finite Sets. Springer-Verlag, Chm (2006). https:\/\/doi.org\/10.1007\/3-540-36023-9"},{"issue":"6","key":"9_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1080\/0233193021000015587","volume":"51","author":"J-V Llinares","year":"2002","unstructured":"Llinares, J.-V.: Abstract convexity, some relations and applications. Optimization 51(6), 797\u2013818 (2002)","journal-title":"Optimization"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0166-218X(01)00222-0","volume":"115","author":"K Murota","year":"2001","unstructured":"Murota, K., Shioura, A.: Relationship of m\/l-convex functions with discrete convex functions by Miller and Favati-Tardella. Discrete Appl. Math. 115, 151\u2013176 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/34.16713","volume":"11","author":"C Ronse","year":"1989","unstructured":"Ronse, C.: A bibliography on digital and computational convexity (1961\u20131988). IEEE Trans. Pattern Anal. Mach. Intell. 11(2), 181\u2013190 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-39923-0_17","volume-title":"Spatial Information Theory. Foundations of Geographic Information Science","author":"AJ Roy","year":"2003","unstructured":"Roy, A.J., Stell, J.G.: Convexity in discrete space. In: Kuhn, W., Worboys, M.F., Timpf, S. (eds.) COSIT 2003. LNCS, vol. 2825, pp. 253\u2013269. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39923-0_17"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45576-0_16","volume-title":"Digital and Image Geometry","author":"J Webster","year":"2001","unstructured":"Webster, J.: Cell complexes and digital convexity. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol. 2243, pp. 272\u2013282. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45576-0_16"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T17:15:43Z","timestamp":1666286143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19897-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031198960","9783031198977"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19897-7_9","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)"}}]}}
