ACM Transactions on Graphics (TOG)
An algorithmic comparison between square- and hexagonal-based grids
CVGIP: Graphical Models and Image Processing
Bresenham's algorithm with Grey scale
Communications of the ACM
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Alternative tilings for improved surface area estimates by local counting algorithms
Computer Vision and Image Understanding
A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids
IEEE Transactions on Visualization and Computer Graphics
Hexagonal Raster for Computer Graphic
IV '00 Proceedings of the International Conference on Information Visualisation
Algorithm for computer control of a digital plotter
IBM Systems Journal
Geometry of neighborhood sequences in hexagonal grid
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
In this paper an algorithm to scan convert a line using method of deviation on hexagonal grid is proposed. The method of deviation computes pixel nearest to analog line using only integer arithmetic. The proposed algorithm is compared favorably with the latest line drawing algorithm on a hexagonal grid. The main advantage of the proposed approach is that the same may be applied to an arbitrary curve. Owing to this approach we may visualize design ideas through animation and photorealistic renderings, and simulate how a design will perform in the real world in CAD tool with less aliasing artifact.