Kenneth E. Smith
ABSTRACT
This paper discusses a mnemonic coding language and translation program used to produce master sheet metal templates on a computer-controlled flatbed plotter. The major advantage of computer-assisted template layout is the ability to reproduce identical templates for use at different locations or to replace mutilated templates by simply reprocessing the original input data cards through a computer-plotter combination. A typical template required about two hours for preparation of the input data and seventeen minutes computer-plotter processing time.
- 1.Robert L. Rosenfeld, "Computer-Assisted Mask Production," IEEE Proc., vol. 57, No. 9, pp. 1629-1634, Sept. 1969.Google Scholar
Cross Ref
- 2.Programmer's Manual, "1620 Drafting System (1620-CX-04X)," IBM Application Program H20-0183.Google Scholar
- 3.Programming and Operator's Guide, "IBM-1130 Disc Monitor System, Version 2," Form C26-3717.Google Scholar
- 4.Programmer's Manual, "IBM-1130/1800 Plotter Subroutines," Form C26-3755.Google Scholar
- 5.Programmer's Manual, "IBM-1130/1800 Basic Fortran IV Language," Form C26-3715.Google Scholar
Index Terms
- Computer-assisted template layout
Recommendations
Fixed time template matching
SMC'09: Proceedings of the 2009 IEEE international conference on Systems, Man and CyberneticsThe problem of finding a match for an image ('template') within a larger image is known as template matching. It is key to a variety of Computer Vision applications. Currently known template matching algorithms run in fixed time, or are guaranteed to ...
Fast Template Matching With Polynomials
Template matching is widely used for many applications in image and signal processing. This paper proposes a novel template matching algorithm, called algebraic template matching. Given a template and an input image, algebraic template matching ...
Comments