3D extension of Bresenham's algorith and its application in straight-line interpretation

Conventional straight-line generating algorithms, such as the digital differential analyser (DDA), Bresenham's algorithm and the mid-point algorithm, are suitable only for planer straight lines on the coordinate planes, of which Bresenham's algorithm is the most efficient. In this paper, the authors have extended Bresenham's algorithm to spatial straight lines. Given a spatial straight-line segment with two end-points, the authors have applied Bresenham's algorithm to the projections of the line segment on two of the three coordinate planes, which is determined by the largest of the coordinate lengths of the line segment, thereby obtaining a three-dimensional extension of the algorithm. In a case study, the authors calculated the distance between each sample position and the given line segment. The result reveals that the actual error at each sample position is smaller than the maximum theoretical error, and the performance of the three-dimensional extension of Bresenham's algorithm is as good as that of Bresenham's original planer algorithm. One of its potential applications is the three-dimensional step straight-line interpolation used in computer numerical control (CNC) systems of machine tools and rapid prototyping machines. Application of the algorithm is contrasted with that of the traditional DDA step straight-line interpolation algorithm. The result confirms that the three-dimensional extension of Bresenham's algorithm is much better than the DDA straight-line interpolation algorithm.