{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:34:27Z","timestamp":1760121267864},"reference-count":0,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:00:00Z","timestamp":1048204800000},"content-version":"vor","delay-in-days":4250,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"published-print":{"date-parts":[[1991,8]]},"abstract":"<jats:p>With any word over the alphabet <jats:styled-content>\u03a0={r, r\u0304, u, \u016b}<\/jats:styled-content>, we associate a connected picture in the following manner: the reading of each letter of this word induces a unit line: <jats:styled-content>r (r\u0304, u, \u016b respectively)<\/jats:styled-content> stands for a right (left, up, down respectively) move. We present a rewriting system which can yield, from any word over \u03a0, all the words describing the same picture. Particularly, we give an algorithm to find a minimal word describing a given picture: this word represents the shortest way to draw this picture without \u2018penup\u2019.<\/jats:p>","DOI":"10.1111\/1467-8659.1040319","type":"journal-article","created":{"date-parts":[[2004,12,21]],"date-time":"2004-12-21T12:44:59Z","timestamp":1103633099000},"page":"319-327","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Shortest Way to Draw a Connected Picture"],"prefix":"10.1111","volume":"10","author":[{"given":"Patrice","family":"Seebold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karine","family":"Slowinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2003,3,21]]},"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2F1467-8659.1040319","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/1467-8659.1040319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:09:51Z","timestamp":1698019791000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/1467-8659.1040319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["10.1111\/1467-8659.1040319"],"URL":"https:\/\/doi.org\/10.1111\/1467-8659.1040319","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,8]]},"assertion":[{"value":"2003-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}