Abstract
An algorithmic comparison between square and hexagonal grids, showing the strong similarity between them, is presented. General digitalization schemes, valid for all real curves of the plane, are presented for the hexagonal grid. A proof of the validity in the hexagonal case of Bresenham's straight-line algorithm for calculating the digitalization of a straight line joining two end-points is given. The transformations necessary to perform correctly the digitalization of a straight line using Bresenham's algorithm on a hexagonal grid are introduced. A simple circle drawing algorithm is presented. A simulator to render graphic primitives both on the hexagonal grid and on the square grid is then introduced, and various outputs of the simulator are shown and discussed.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call