{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:28:17Z","timestamp":1772119697699,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-15-CE40-0006"],"award-info":[{"award-number":["ANR-15-CE40-0006"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10851-023-01155-w","type":"journal-article","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T08:02:11Z","timestamp":1689580931000},"page":"754-769","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Envelope Operator for Full Convexity to Define Polyhedral Models in Digital Spaces"],"prefix":"10.1007","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5178-0842","authenticated-orcid":false,"given":"Fabien","family":"Feschet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4236-2133","authenticated-orcid":false,"given":"Jacques-Olivier","family":"Lachaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"key":"1155_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. Discrete Math. 306, 3181\u20133188 (2006)","journal-title":"Discrete Math."},{"issue":"1","key":"1155_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02574364","volume":"12","author":"AI Barvinok","year":"1994","unstructured":"Barvinok, A.I.: Computing the Ehrhart polynomial of a convex lattice polytope. Discrete Comput. Geom. 12(1), 35\u201348 (1994)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"1155_CR3","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. Theor. Comput. Sci. 283(1), 151\u2013170 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1155_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"CB Bradford","year":"1996","unstructured":"Bradford, 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":"1155_CR5","doi-asserted-by":"crossref","unstructured":"Eckhardt, U.: Digital lines and digital convexity. In: Digital and Image Geometry, Advanced Lectures [Based on a Winter School Held at Dagstuhl Castle, Germany in December 2000], pp. 209\u2013228. Springer (2001)","DOI":"10.1007\/3-540-45576-0_13"},{"key":"1155_CR6","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-031-19897-7_9","volume-title":"Discrete Geometry and Mathematical Morphology, volume 13493 of Lecture Notes in Computer Science","author":"F Feschet","year":"2022","unstructured":"Feschet, F., Lachaud, J.-O.: Full convexity for polyhedral models in digital spaces. In: Baudrier, \u00c9., Naegel, B., Kr\u00e4henb\u00fchl, A., Tajine, M. (eds.) Discrete Geometry and Mathematical Morphology, volume 13493 of Lecture Notes in Computer Science, pp. 98\u2013109. Springer, Cham (2022)"},{"key":"1155_CR7","doi-asserted-by":"crossref","unstructured":"Kiselman, C.O.: Convex functions on discrete sets. In: Klette, R., \u017duni\u0107, J. (eds.) Combinatorial Image Analysis. 10th International Workshop, IWCIA, LNCS 3322, pp. 443\u2013457. Springer (2004)","DOI":"10.1007\/978-3-540-30503-3_32"},{"key":"1155_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/12584","volume-title":"Elements of Digital Geometry, Mathematical Morphology, and Discrete Optimization","author":"CO Kiselman","year":"2022","unstructured":"Kiselman, C.O.: Elements of Digital Geometry, Mathematical Morphology, and Discrete Optimization. World Scientific, Singapore (2022)"},{"key":"1155_CR9","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":"1155_CR10","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":"1155_CR11","doi-asserted-by":"crossref","unstructured":"Lachaud, J.-O.: An alternative definition for digital convexity. In: Lindblad, J., Malmberg, F., Sladoje, N. (eds.) Discrete Geometry and Mathematical Morphology\u2014First International Joint Conference, DGMM 2021, Uppsala, Sweden, May 24\u201327, 2021, Proceedings, volume 12708 of LNCS, pp. 269\u2013282. Springer (2021)","DOI":"10.1007\/978-3-030-76657-3_19"},{"key":"1155_CR12","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/s10851-022-01076-0","volume":"64","author":"J-O Lachaud","year":"2022","unstructured":"Lachaud, J.-O.: An alternative definition for digital convexity. J. Math. Imaging Vis. 64, 718\u2013735 (2022)","journal-title":"J. Math. Imaging Vis."},{"key":"1155_CR13","volume-title":"Function Algebras on Finite Sets","author":"D Lau","year":"2006","unstructured":"Lau, D.: Function Algebras on Finite Sets. Springer, New York (2006)"},{"issue":"6","key":"1155_CR14","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":"1155_CR15","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\u2013Tardella. Discrete Appl. Math. 115, 151\u2013176 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"1155_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2018.e00512","volume":"4","author":"G Mei","year":"2018","unstructured":"Mei, G., Zhang, J., Nengxiong, X., Zhao, K.: A sample implementation for parallelizing divide-and-conquer algorithms on the GPU. Heliyon 4(1), e00512 (2018)","journal-title":"Heliyon"},{"issue":"2","key":"1155_CR17","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. Intel. 11(2), 181\u2013190 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"key":"1155_CR18","doi-asserted-by":"crossref","unstructured":"Roy, Anthony J., Stell, J.G.: Convexity in discrete space. In: Kuhn, W., Worboys, M., Timpf, S. (eds.) COSIT. LNCS 2825, pp. 253\u2013269. Springer (2003)","DOI":"10.1007\/978-3-540-39923-0_17"},{"key":"1155_CR19","doi-asserted-by":"crossref","unstructured":"Webster, J.: Cell complexes and digital convexity. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry: Advanced Lectures, volume 2243 of Lecture Notes in Computer Science, pp. 272\u2013282. Springer, Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-45576-0_16"}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-023-01155-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10851-023-01155-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-023-01155-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T11:35:55Z","timestamp":1694691355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10851-023-01155-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,17]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1155"],"URL":"https:\/\/doi.org\/10.1007\/s10851-023-01155-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2453478\/v1","asserted-by":"object"}]},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"value":"0924-9907","type":"print"},{"value":"1573-7683","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,17]]},"assertion":[{"value":"7 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}