Abstract
A summary of the history and current state of deckle filling by computer software is presented using non-mathematical terminology. The techniques commonly used to produce deckle fills are described including the basic algorithmic approaches such as linear programming and sequential approach. The requirements of a fully automatic deckle filling software module are also discussed, and a new hybrid approach for time sequencing in deckle filling systems is proposed.
| Original language | English |
|---|---|
| Pages | 633-639 |
| Number of pages | 7 |
| Publication status | Published - 1 Dec 1999 |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver