{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:17:19Z","timestamp":1649103439004},"reference-count":17,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T00:00:00Z","timestamp":1517356800000},"content-version":"vor","delay-in-days":122,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2017,12,11]]},"published-print":{"date-parts":[[2017,10]]},"abstract":"<jats:p>We introduce unusual methods for the digitization process of a line. A square pixel of the computer screen is blackened when the line crosses a special part of this pixel, called the active pixel. The shape of this active pixel is discussed, in the following sense: can we obtain the new Freeman Code of the line, using of a mechanical transformation of the initial Freeman Code, which is the classical Cutting Sequence? Our choice is to limit mechanical transformations to the existence of a given transducer, so that everytime we put in (a power of) the classical Freeman Code of a line, the output recovers the new Freeman Code. Then we prove that such a transducer exists if and only if the active pixel is a polygon with rational vertices and big enough. The same result can be proved if we introduce several grey levels in the representation of the line. Then we get some antialising effects.<\/jats:p>","DOI":"10.1051\/ita\/2017016","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T08:50:38Z","timestamp":1517388638000},"page":"169-180","source":"Crossref","is-referenced-by-count":0,"title":["Translation of a Digital Line into another according to various Digitization Processes"],"prefix":"10.1051","volume":"51","author":[{"given":"Jean-Pierre","family":"Borel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Allouche J.-P., \nShallit J., \nAutomatic Sequences: Theory and Applications. \nCambridge University Press, \nCambridge \n(2003).","DOI":"10.1017\/CBO9780511546563"},{"key":"R2","unstructured":"Berstel J., Trac\u00e9 de droites, fractions continues et morphismes r\u00e9els, in \nLothaire M., \n\u201cMots\u201d, M\u00e9langes offerts \u00e1 M.P. Schutzenberger, Herm\u00e8s \n(1990)."},{"key":"R3","unstructured":"Berstel J. and \nSe\u00e9bold P., Sturmian words, in \nAlgebraic Combinatorics on Words, edited by \nLothaire M.. \nCambridge University Press \n(2002)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.tcs.2005.03.036","volume":"340\u2013342","author":"Borel","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"R5","first-page":"59","volume":"44","author":"Borel","year":"2010","journal-title":"RAIRO: ITA"},{"key":"R6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1147\/sj.41.0025","volume":"4","author":"Bresenham","year":"1965","journal-title":"IBM Syst. J."},{"key":"R7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.5802\/jtnb.83","volume":"5","author":"Crisp","year":"1993","journal-title":"J. Th\u00e9orie des Nombres Bordeaux"},{"key":"R8","unstructured":"Foley J.D. and \nVan Dam A., \nFundamentals of Interactive Computer Graphics. \nAddison-Wesley, \nCambridge \n(1982)."},{"key":"R9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","volume":"10","author":"Freeman","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"key":"R10","unstructured":"Hegron G., \nSynth\u00e8se d\u2019images : algorithmes \u00e9l\u00e9mentaires. \nDunod, \nParis \n(1985)."},{"key":"R11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1051\/ita\/1997310302711","volume":"31","author":"Justin","year":"1997","journal-title":"Theor. Inform. Appl."},{"key":"R12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TPAMI.1981.4767075","volume":"PAMI-3","author":"Koplowitz","year":"1981","journal-title":"IEEE Trans Pattern Anal. Machine Intell."},{"key":"R13","unstructured":"Newman W.M. and \nSproull R.F., \nPrinciples of Interactive Computer Graphics. \nMcGraw-Hill \n(1985)."},{"key":"R14","unstructured":"Pitteway M.L.V. and \nEarnshax R.A., in Euclid\u2019s Algorithm and Line Drawing, \nFundamental Algorithms in Computer Graphics. \nSpringer Verlag \n(1985) 101\u2013105."},{"key":"R15","unstructured":"Reveilles J.-P., \nG\u00e9om\u00e9trie discr\u00e9te, calcul en nombres entiers et algorithmique. Thesis, \nUniv. Louis Pasteur \u2013 Strasbourg, France \n(1991)."},{"key":"R16","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1109\/T-C.1974.223845","volume":"32","author":"Rosenfeld","year":"1974","journal-title":"IEEE Trans. Comput."},{"key":"R17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF03025802","volume":"7","author":"Series","year":"1985","journal-title":"Math. Intell."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2017016\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T11:53:56Z","timestamp":1630670036000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2017016"}},"subtitle":[],"editor":[{"given":"J.","family":"Leroy","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"M.","family":"Rigo","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"E.","family":"Charlier","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":17,"journal-issue":{"issue":"4"},"alternative-id":["ita170089"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2017016","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}