Algorithm 54 - Approximation of straight lines
Sale, AHJ (1970) Algorithm 54 - Approximation of straight lines. The Computer Journal, 13 (4). pp. 422-424. AbstractThis routine implements a method described by JE Bresenham (1965) for teh control of an incremental digital plotter in USASI FORTRAN. A similar algorithm has been published before (Stockton, 1963) which is externally identical to that given here (it produces the same set of increments); this version is simpler and written to achieve fast execution of the inner loop. No multiplications or divisions are needed. | Item Type: | Article |
|---|
| Keywords: | digital plotting, straight line approximation, best-fit, cartesian grid, algorithm |
|---|
| ID Code: | 142 |
|---|
| Deposited By: | utas eprints |
|---|
| Deposited On: | 09 Jan 2005 |
|---|
| Last Modified: | 18 Jul 2008 19:38 |
|---|
| ePrint Statistics: | View statistics for this ePrint |
|---|
Repository Staff Only: item control page
|