Efficient Transfer Planning for Flat Knitting
Conference Paper, Proceedings of 2nd ACM Symposium on Computational Fabrication (SCF '18), June, 2018
Abstract
Industrial knitting machines form fabric by manipulating loops of yarn held on hundreds of hook-shaped needles. Transfer planning algorithms generate a sequence of machine instructions that move loops between their current needles and given target needles. In this paper we describe how to compute the run-time cost of a transfer plan in terms of machine passes, and compare the plans generated by several existing and new transfer planning algorithms under this metric over a a large benchmarking set of transfer operations taken from example flat lace patterns, along with synthetically generated patterns.
BibTeX
@conference{Lin-2018-113390,author = {Jenny Lin and Vidya Narayanan and James McCann},
title = {Efficient Transfer Planning for Flat Knitting},
booktitle = {Proceedings of 2nd ACM Symposium on Computational Fabrication (SCF '18)},
year = {2018},
month = {June},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.