论文信息 - Algorithm for Generating a Digital Straight Line on a Triangular Grid

Algorithm for Generating a Digital Straight Line on a Triangular Grid

An algorithm is presented for generating the optimum straight-line approximation for a plotter constrained to move a unit distance at a time in one of six equi-spaced directions. The algorithm facilitates the drawing of digital straight lines on a triangular grid.

HERBERT FREEMAN

[1] Jack Bresenham,et al. Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[2] Charalambos D. Stamopoulos. Parallel Algorithms for Joining Two Points by a Straight-Line Segment , 1974, IEEE Transactions on Computers.

[3] Rani Siromoney,et al. Hexagonal arrays and rectangular blocks , 1976 .

[4] Herbert Freeman,et al. On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[5] Marcel J. E. Golay,et al. Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.