{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:20:36Z","timestamp":1740097236089,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319261447"},{"type":"electronic","value":"9783319261454"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26145-4_12","type":"book-chapter","created":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T23:57:54Z","timestamp":1451951874000},"page":"157-171","source":"Crossref","is-referenced-by-count":0,"title":["Thoughts on 3D Digital Subplane Recognition and Minimum-Maximum of a Bilinear Congruence Sequence"],"prefix":"10.1007","author":[{"given":"Eric","family":"Andres","sequence":"first","affiliation":[]},{"given":"Dimitri","family":"Ouattara","sequence":"additional","affiliation":[]},{"given":"Gaelle","family":"Largeteau-Skapin","sequence":"additional","affiliation":[]},{"given":"Rita","family":"Zrour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,6]]},"reference":[{"issue":"5","key":"12_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/gmip.1997.0427","volume":"59","author":"E Andres","year":"1997","unstructured":"Andres, E., Acharya, R., Sibata, C.: Discrete analytical hyperplanes. Graphical Models Image Process. 59(5), 302\u2013309 (1997)","journal-title":"Graphical Models Image Process."},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-19867-0_4","volume-title":"Discrete Geometry for Computer Imagery","author":"V Berth\u00e9","year":"2011","unstructured":"Berth\u00e9, V., Labb\u00e9, S.: An Arithmetic and combinatorial approach to three-dimensional discrete lines. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 47\u201358. Springer, Heidelberg (2011)"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.dam.2006.08.004","volume":"155","author":"VE Brimkov","year":"2007","unstructured":"Brimkov, V.E., Coeurjolly, D., Klette, R.: Digital planarity - a review. Discrete Appl. Math. 155(4), 468\u2013495 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0146-664X(74)90010-0","volume":"3","author":"R Brons","year":"1974","unstructured":"Brons, R.: Linguistic methods for the description of a straight line on a grid. Comput. Graphics Image Process. 3(1), 48\u201362 (1974)","journal-title":"Comput. Graphics Image Process."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01762232","volume":"7","author":"EM Coven","year":"1973","unstructured":"Coven, E.M., Hedlund, G.: Sequences with minimal block growth. Math. Syst. Theory 7(2), 138\u2013153 (1973)","journal-title":"Math. Syst. Theory"},{"issue":"04","key":"12_CR6","first-page":"635","volume":"09","author":"I Debled-Rennesson","year":"1995","unstructured":"Debled-Rennesson, I., Reveilles, J.P.: A linear algorithm for segmentation of digital curves. IJPRAI 09(04), 635\u2013662 (1995)","journal-title":"IJPRAI"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.dam.2008.05.030","volume":"157","author":"M Dexet","year":"2009","unstructured":"Dexet, M., Andres, E.: A generalized preimage for the digital analytical hyperplane recognition. Discrete Appl. Math. 157(3), 476\u2013489 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"12_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.dam.2005.02.025","volume":"151","author":"F Feschet","year":"2005","unstructured":"Feschet, F., Tougne, L.: On the min DSS problem of closed discrete curves. Discrete Appl. Math. 151(1\u20133), 138\u2013153 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"12_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.dam.2005.02.026","volume":"151","author":"Y G\u00e9rard","year":"2005","unstructured":"G\u00e9rard, Y., Debled-Rennesson, I., Zimmermann, P.: An elementary digital plane recognition algorithm. Discrete Appl. Math. 151(1\u20133), 169\u2013183 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"12_CR10","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 - a review. Discrete Appl. Math. 139(1\u20133), 197\u2013230 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"15","key":"12_CR11","doi-asserted-by":"publisher","first-page":"2293","DOI":"10.1016\/j.dam.2012.08.038","volume":"161","author":"JO Lachaud","year":"2013","unstructured":"Lachaud, J.O., Said, M.: Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line. Discrete Appl. Math. 161(15), 2293\u20132315 (2013)","journal-title":"Discrete Appl. Math."},{"key":"12_CR12","unstructured":"Largeteau-Skapin, G., Debled-Rennesson, I.: Outils arithm\u00e9tiques pour la g\u00e9om\u00e9trie discr\u00e8te. In: G\u00e9om\u00e9trie discr\u00e8te et images num\u00e9riques, pp. 59\u201374. Trait\u00e9 IC2 - Traitement du signal et de l\u2019image, Herm\u00e8s - Lavoisier (2007)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.dam.2014.06.006","volume":"183","author":"JD Ouattara","year":"2015","unstructured":"Ouattara, J.D., Andres, E., Largeteau-Skapin, G., Zrour, R., Tapsoba, T.M.: Remainder approach for the computation of digital straight line subsegment characteristics. Discrete Appl. Math. 183, 90\u2013101 (2015). \n                      http:\/\/dx.doi.org\/10.1016\/j.dam.2014.06.006","journal-title":"Discrete Appl. Math."},{"key":"12_CR14","unstructured":"Reveill\u00e8s, J.P.: Calcul en Nombres Entiers et Algorithmique. Ph.D. thesis, Universit\u00e9 Louis Pasteur, Strasbourg, France (1991)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-04397-0_11","volume-title":"Discrete Geometry for Computer Imagery","author":"M Said","year":"2009","unstructured":"Said, M., Lachaud, J.-O., Feschet, F.: Multiscale discrete geometry. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 118\u2013131. Springer, Heidelberg (2009)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-37067-0_3","volume-title":"Discrete Geometry for Computer Imagery","author":"I Sivignon","year":"2013","unstructured":"Sivignon, I.: Walking in the Farey fan to compute the characteristics of a discrete straight line subsegment. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 23\u201334. Springer, Heidelberg (2013)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/11907350_57","volume-title":"Discrete Geometry for Computer Imagery","author":"I Sivignon","year":"2006","unstructured":"Sivignon, I., Coeurjolly, D.: Minimal decomposition of a digital surface into digital plane segments Is NP-hard. In: Kuba, A., Ny\u00fal, L.G., Pal\u00e1gyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 674\u2013685. Springer, Heidelberg (2006)"},{"issue":"42","key":"12_CR18","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1016\/j.patcog.2008.11.003","volume":"10","author":"T Fernique","year":"2009","unstructured":"Fernique, T.: Generation and recognition of digital planes using multi-dimensional continued fractions. Pattern Recogn. 10(42), 2229\u20132238 (2009)","journal-title":"Pattern Recogn."},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.cviu.2012.07.006","volume":"117","author":"A Vacavant","year":"2013","unstructured":"Vacavant, A., Roussillon, T., Kerautret, B., Lachaud, J.O.: A combined multi-scale\/irregular algorithm for the vectorization of noisy digital contours. Comput. Vis. Image Underst. 117(4), 438\u2013450 (2013)","journal-title":"Comput. Vis. Image Underst."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26145-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:20:59Z","timestamp":1559362859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26145-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319261447","9783319261454"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26145-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}