ABSTRACT
This chapter investigates the relative benefits that the lattices provide for representing lines and curves. It discusses the literature survey of hexagonal sampling and details of the hexagonal simulator. It then presents the Rasterization algorithms on a hexagonal grid and the performance analysis of the rasterization algorithm on both square and hexagonal grids. The general equation of a line is simpler than that of a curve. This explains why there is a large body of literature that examines the problem of efficient line drawing on raster displays. The chapter discusses the theoretical study of drawing the hexagonal pixel, the routine for mapping Cartesian coordinates to hexagonal coordinates, the routine for mapping hexagonal coordinates to Cartesian coordinates, pixel drawing and storing, deviation calculation, and GUI design. The deviation will be calculated as the distance between each selected pixel and the actual image. The deviation calculation of the coordinates in a hexagonal grid is different from that of square grid.
