A graph-theoretical approach to a plotter pen touring problem

Ernst Rank; Heinrich Werner

doi:10.1016/0045-7825(82)90056-1

A graph-theoretical approach to a plotter pen touring problem

Ernst Rank, Heinrich Werner

Engineering and Design

Technical University of Munich

Research output: Contribution to journal › Article › peer-review

Abstract

A graph-theoretical approach to the problem of optimizing the sequence of plot commands is presented. The mesh to be drawn is described by a graph which is extended to an Euler graph. In the extended graph an Euler tour is found, which is associated with the tour of the pen. A typical application of the algorithm is that of plotting meshes as they appear in finite element problems.

Original language	English
Pages (from-to)	95-102
Number of pages	8
Journal	Computer Methods in Applied Mechanics and Engineering
Volume	30
Issue number	1
DOIs	https://doi.org/10.1016/0045-7825(82)90056-1
State	Published - Apr 1982

Access to Document

10.1016/0045-7825(82)90056-1

Cite this

@article{cca55e7444b14345b1bf4c223313bc35,

title = "A graph-theoretical approach to a plotter pen touring problem",

abstract = "A graph-theoretical approach to the problem of optimizing the sequence of plot commands is presented. The mesh to be drawn is described by a graph which is extended to an Euler graph. In the extended graph an Euler tour is found, which is associated with the tour of the pen. A typical application of the algorithm is that of plotting meshes as they appear in finite element problems.",

author = "Ernst Rank and Heinrich Werner",

year = "1982",

month = apr,

doi = "10.1016/0045-7825(82)90056-1",

language = "English",

volume = "30",

pages = "95--102",

journal = "Computer Methods in Applied Mechanics and Engineering",

issn = "0045-7825",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A graph-theoretical approach to a plotter pen touring problem

AU - Rank, Ernst

AU - Werner, Heinrich

PY - 1982/4

Y1 - 1982/4

N2 - A graph-theoretical approach to the problem of optimizing the sequence of plot commands is presented. The mesh to be drawn is described by a graph which is extended to an Euler graph. In the extended graph an Euler tour is found, which is associated with the tour of the pen. A typical application of the algorithm is that of plotting meshes as they appear in finite element problems.

AB - A graph-theoretical approach to the problem of optimizing the sequence of plot commands is presented. The mesh to be drawn is described by a graph which is extended to an Euler graph. In the extended graph an Euler tour is found, which is associated with the tour of the pen. A typical application of the algorithm is that of plotting meshes as they appear in finite element problems.

UR - http://www.scopus.com/inward/record.url?scp=0020120222&partnerID=8YFLogxK

U2 - 10.1016/0045-7825(82)90056-1

DO - 10.1016/0045-7825(82)90056-1

M3 - Article

AN - SCOPUS:0020120222

SN - 0045-7825

VL - 30

SP - 95

EP - 102

JO - Computer Methods in Applied Mechanics and Engineering

JF - Computer Methods in Applied Mechanics and Engineering

IS - 1

ER -

A graph-theoretical approach to a plotter pen touring problem

Abstract

Access to Document

Other files and links

Fingerprint

Cite this