A graph-theoretical approach to a plotter pen touring problem

DOI10.1016/0045-7825(82)90056-1zbMath0479.68101OpenAlexW2083407661MaRDI QIDQ1162175

Heinrich Werner, Ernst Rank

Publication date: 1982

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(82)90056-1

zbMATH Keywords

computer graphicsEuler graphEuler tourfinite element problemsoptimizing the sequence of plot commandsplotting meshes

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05) Computing methodologies and applications (68U99) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Matching, Euler tours and the Chinese postman
• Unnamed Item
• Unnamed Item

This page was built for publication: A graph-theoretical approach to a plotter pen touring problem