{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:31:15Z","timestamp":1725507075032},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540791256"},{"type":"electronic","value":"9783540791263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79126-3_7","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T14:48:22Z","timestamp":1207320502000},"page":"57-68","source":"Crossref","is-referenced-by-count":4,"title":["Combinatorial View of Digital Convexity"],"prefix":"10.1007","author":[{"given":"Sre\u010dko","family":"Brlek","sequence":"first","affiliation":[]},{"given":"Jacques-Olivier","family":"Lachaud","sequence":"additional","affiliation":[]},{"given":"X.","family":"Proven\u00e7al","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0031-3203(70)90037-3","volume":"2","author":"J. Sklansky","year":"1970","unstructured":"Sklansky, J.: Recognition of convex blobs. Pattern Recognition\u00a02(1), 3\u201310 (1970)","journal-title":"Pattern Recognition"},{"key":"7_CR2","volume-title":"Perceptrons","author":"M. Minsky","year":"1988","unstructured":"Minsky, M., Papert, S.: Perceptrons, 2nd edn. MIT Press, Cambridge (1988)","edition":"2"},{"issue":"6","key":"7_CR3","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1109\/TPAMI.1981.4767162","volume":"3","author":"C. Kim","year":"1981","unstructured":"Kim, C.: On the cellular convexity of complexes. Pattern Analysis and Machine Intelligence\u00a03(6), 617\u2013625 (1981)","journal-title":"Pattern Analysis and Machine Intelligence"},{"issue":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1109\/TPAMI.1982.4767315","volume":"4","author":"C. Kim","year":"1982","unstructured":"Kim, C.: Digital convexity, straightness, and convex polygons. Pattern Analysis and Machine Intelligence\u00a04(6), 618\u2013626 (1982)","journal-title":"Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"7_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1109\/TPAMI.1982.4767221","volume":"4","author":"C. Kim","year":"1982","unstructured":"Kim, C., Rosenfeld, A.: Digital straight lines and convexity of digital regions. Pattern Analysis and Machine Intelligence\u00a04(2), 149\u2013153 (1982)","journal-title":"Pattern Analysis and Machine Intelligence"},{"issue":"12","key":"7_CR6","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1016\/S0031-3203(98)00065-X","volume":"31","author":"B. Chaudhuri","year":"1998","unstructured":"Chaudhuri, B., Rosenfeld, A.: On the computation of the digital convex hull and circular hull of a digital region. Pattern Recognition\u00a031(12), 2007\u20132016 (1998)","journal-title":"Pattern Recognition"},{"issue":"1-3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.dam.2002.12.001","volume":"139","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital straightness\u2014a review. Discrete Appl. Math.\u00a0139(1-3), 197\u2013230 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(02)00227-5","volume":"125","author":"I. Debled-Rennesson","year":"2003","unstructured":"Debled-Rennesson, I., R\u00e9my, J.-L., Rouyer-Degli, J.: Detection of the discrete convexity of polyominoes. Discrete Appl. Math.\u00a0125(1), 115\u2013133 (2003)","journal-title":"Discrete Appl. Math."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-49126-0_3","volume-title":"Discrete Geometry for Computer Imagery","author":"F. Feschet","year":"1999","unstructured":"Feschet, F., Tougne, L.: Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol.\u00a01568, pp. 31\u201340. Springer, Heidelberg (1999)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1016\/j.imavis.2006.06.019","volume":"25","author":"J.O. Lachaud","year":"2007","unstructured":"Lachaud, J.O., Vialard, A., de Vieilleville, F.: Fast, accurate and convergent tangent estimation on digital contours. Image and Vision Computing\u00a025, 1572\u20131587 (2007)","journal-title":"Image and Vision Computing"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-39966-7_26","volume-title":"Discrete Geometry for Computer Imagery","author":"S. Brlek","year":"2003","unstructured":"Brlek, S., Labelle, G., Lacasse, A.: Incremental Algorithms Based on Discrete Green Theorem. In: Nystr\u00f6m, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol.\u00a02886, pp. 277\u2013287. Springer, Heidelberg (2003)"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.dam.2004.09.011","volume":"147","author":"S. Brlek","year":"2005","unstructured":"Brlek, S., Labelle, G., Lacasse, A.: Algorithms for polyominoes based on the discrete Green theorem. Discrete Applied Math\u00a0147(3), 187\u2013205 (2005)","journal-title":"Discrete Applied Math"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"DGCI 2008","author":"S. Brlek","year":"2008","unstructured":"Brlek, S., Labelle, G., Lacasse, A.: On minimal moment of inertia polyominoes. In: Coeurjolly, D., et al. (eds.) DGCI 2008. LNCS, vol.\u00a04992, Springer, Heidelberg (2008)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03572, pp. 189\u2013198. Springer, Heidelberg (2005)"},{"issue":"3","key":"7_CR15","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.\u00a017(3), 543\u2013556 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR16","series-title":"Electronic Notes in Discrete Mathematics","volume-title":"Proc.\u00a0IWCIA 2003, Int. Workshop on Combinatorial Image Analysis","author":"A. Daurat","year":"2003","unstructured":"Daurat, A., Nivat, M.: Salient and reentrant points of discrete sets. In: del Lungo, A., di Gesu, V., Kuba, A. (eds.) Proc.\u00a0IWCIA 2003, Int. Workshop on Combinatorial Image Analysis, Palermo, Italia, May 14\u201316. Electronic Notes in Discrete Mathematics, Elsevier Science, Amsterdam (2003)"},{"key":"7_CR17","unstructured":"Brlek, S., Labelle, G., Lacasse, A.: Shuffle operations on lattice paths. In: Rigo, M. (ed.) Proc.\u00a0CANT 2006, Int. School and Conf. on Combinatorics, Automata and Number theory, Li\u00e8ge, Belgium, May 8\u201319, pp. 8\u201319. University of Li\u00e8ge (2006)"},{"key":"7_CR18","unstructured":"Brlek, S., Labelle, G., Lacasse, A.: Shuffle operations on discrete paths. In: Theoret. Comput. Sci. (in press, 2007)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/11907350_34","volume-title":"Discrete Geometry for Computer Imagery","author":"S. Brlek","year":"2006","unstructured":"Brlek, S., Proven\u00e7al, X.: An Optimal Algorithm for Detecting Pseudo-squares. In: Kuba, A., Ny\u00fal, L.G., Pal\u00e1gyi, K. (eds.) DGCI 2006. LNCS, vol.\u00a04245, pp. 403\u2013412. Springer, Heidelberg (2006)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Brlek, S., F\u00e9dou, J.-M., Proven\u00e7al, X.: On the tiling by translation problem. Discrete Applied Math. (to appear, 2008)","DOI":"10.1016\/j.dam.2008.05.026"},{"key":"7_CR21","volume-title":"Cambridge Mathematical Library","author":"M. Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on words. In: Cambridge Mathematical Library, Cambridge University Press, Cambridge (1997)"},{"key":"7_CR22","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic combinatorics on words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic combinatorics on words. Encyclopedia of Mathematics and its Applications, vol.\u00a090. Cambridge University Press, Cambridge (2002)"},{"key":"7_CR23","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied combinatorics on words","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied combinatorics on words. Encyclopedia of Mathematics and its Applications, vol.\u00a0105. Cambridge University Press, Cambridge (2005)"},{"issue":"4","key":"7_CR24","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J.P. Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms\u00a04(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"7_CR25","first-page":"145","volume":"6","author":"E.B. Christoffel","year":"1875","unstructured":"Christoffel, E.B.: Observatio arithmetica. Annali di Mathematica\u00a06, 145\u2013152 (1875)","journal-title":"Annali di Mathematica"},{"issue":"1","key":"7_CR26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.5802\/jtnb.77","volume":"5","author":"J.P. Borel","year":"1993","unstructured":"Borel, J.P., Laubie, F.: Quelques mots sur la droite projective r\u00e9elle. J. Th\u00e9or. Nombres Bordeaux\u00a05(1), 23\u201351 (1993)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"issue":"1-2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0304-3975(96)00101-6","volume":"178","author":"J. Berstel","year":"1997","unstructured":"Berstel, J., de Luca, A.: Sturmian words, Lyndon words and trees. Theoret. Comput. Sci.\u00a0178(1-2), 171\u2013203 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR28","unstructured":"Reveill\u00e8s, J.P.: G\u00e9om\u00e9trie discr\u00e8te, calcul en nombres entiers et algorithmique. PhD thesis, Universit\u00e9 Louis Pasteur, Strasbourg (December 1991)"},{"issue":"3","key":"7_CR29","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Math. 23(3) (1978) 207\u2013210","journal-title":"Discrete Math."},{"key":"7_CR30","unstructured":"Proven\u00e7al, X.: Combinatoire des mots, pavages et g\u00e9om\u00e9trie discr\u00e8te. PhD thesis, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, Montr\u00e9al (2008)"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79126-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:22Z","timestamp":1619521882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79126-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540791256","9783540791263"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79126-3_7","relation":{},"subject":[]}}