The Shortest Way to Draw a Connected Picture

Simple item page
dc.contributor.authorSeebold, Patriceen_US
dc.contributor.authorSlowinski, Karineen_US
dc.date.accessioned2014-10-21T06:23:21Z
dc.date.available2014-10-21T06:23:21Z
dc.date.issued1991en_US
dc.description.abstractWith any word over the alphabet ?=r, r?, u, u, we associate a connected picture in the following manner: the reading of each letter of this word induces a unit line: r (r?, u, u respectively) stands for a right (left, up, down respectively) move. We present a rewriting system which can yield, from any word over ?, 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 penup .en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume10en_US
dc.identifier.doi10.1111/1467-8659.1040319en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages319-327en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1040319en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleThe Shortest Way to Draw a Connected Pictureen_US
Files
Collections
Issue 4