The Shortest Way to Draw a Connected Picture
No Thumbnail Available
Date
1991
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Science Ltd and the Eurographics Association
Abstract
With 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 .
Description
@article{10.1111:1467-8659.1040319,
journal = {Computer Graphics Forum},
title = {{The Shortest Way to Draw a Connected Picture}},
author = {Seebold, Patrice and Slowinski, Karine},
year = {1991},
publisher = {Blackwell Science Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.1040319}
}