Prabukumar Manoharan
ABSTRACT
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.
- http://www.geom.uiuc.edu/docs/reference/CRC-formulas/node7.html.Google Scholar
- http://mathandmultimedia.com/2011/06/04/regular-tessellations/Google Scholar
- Bresenham, J. E. (1965). Algorithm for computer control of a digital plotter.IBM Systems Journal, 4(1):25--30. Google ScholarDigital Library
- Bresenham, J. (1977). A linear algorithm for incremental digital display of circular arcs. Communications of the ACM, 20:100--106. Google ScholarDigital Library
- Bao, P. G. and Rokne, J. G. (1989). Quadruple-step line generation. Computers and Graphics, 13(4):461--469.Google ScholarCross Ref
- Farin, G. A History of Curves and Surfaces in CAGD, Handbook of Computer Aided Geometric Design.Google Scholar
- Iba~nez, L., Hamitouche, C., and Roux, C. (2001). A vectorial algorithm for tracing discrete straight lines in N-dimensional generalized grids. IEEE Trans. Vis. Comput. Graph, 7(2):97--108. Google ScholarDigital Library
- Miller, E. G. (1999). Alternative tilings for improved surface area estimates by local counting algorithms. Computer Vision and Image Understanding, 74(3):193--211. Google ScholarDigital Library
- Nagy,B.(2006). Geometry of neighborhood sequences in hexagonal grid, in: Proceedings of Discrete Geometry for Computer Imagery, DGCI 2006, Szeged, Hungary, in: Lecture Notes in Computer Science, LNCS, vol. 4245, 2006, 53--64. Google ScholarDigital Library
- Nagy,B.(2009). Isometric transformations of the dual of the hexagonal lattice, in: Proceedings of 6th International Symposium on Image and Signal Processing and Analysis, ISPA 2009, Salzburg, Austria, pp. 432--437.Google ScholarCross Ref
- {Nagy,B.(2007). Non-metrical distances on the hexagonal grid using neighborhood sequences, Pattern Recognition and Image Analysis 17 (2007) 183--190.Google ScholarCross Ref
- Pitteway, M. L. V. and Watkinson, D. J. (1980). Bresenham's algorithm with grey scale. Communications of the ACM, 23:625--626. Google ScholarDigital Library
- Prabukumar, M.(2011).Improved Mid-point Line Drawing Algorithm on an Interleaved Grid. International Journal of Computer Information Systems, 2(3):8--12.Google Scholar
- Prabukumar, M.(2011).An improved mid-point circle drawing algorithm on a hexagonal grid. Journal of Advanced Research in Computer Science, 3(1): 41--57.Google Scholar
- Prabukumar, M.(2011).Line Drawing algorithm on an interleaved grid. International Journal of Computer Applications, 19(4):1--7.Google ScholarCross Ref
- Prabukumar, M., Ray, B. K. (2012). A Mid -point Ellipse Drawing Algorithm on a Hexagonal Grid. International Journal of Computer Graphics, 3(1):17--24.Google Scholar
- Ray, K. S., and Ray, B. K. (2011). A Method of Deviation for Drawing Implicit Curves. International Journal of Computer Graphics, 2(2):11--21.Google Scholar
- Ray, K. S., and Ray, B. K. (2012). Drawing lines and conics sections using method of deviation. International Journal of Computer Graphics, 3(2): 1--26.Google ScholarCross Ref
- Rokne, J. G., Wyvill, B., and Wu, X. (1990). Fast line scan-conversion.ACM Transactions on Graphics, 9(4):376--388. Google ScholarDigital Library
- Staunton, R. C.(1989). Hexagonal image sampling, a practical proposition", Proc. SPIE, 1008, (1989),pp. 23--27.Google ScholarCross Ref
- Staunton, R. C. and Storey, N. (1999). A comparison between square and hexagonal sampling methods for pipeline image processing.Google Scholar
- Tran-Thong (1982). A symmetric linear algorithm for line segment generation. Computers and Graphics, 6(1):15--17.Google ScholarCross Ref
- Tytkowski, K. T. (2000). Hexagonal raster for computer graphic. In IV, page 69. Google ScholarDigital Library
- Wuthrich, C. A. and Stucki, P. (1991). An algorithmic comparison between square- and hexagonal-based grids. Computer Vision, Graphics, and Image Processing. Graphical Models and Image Processing, 53(4):324--339. Google ScholarDigital Library
- Yong-Kui, L. (1993). The generation of straight lines on hexagonal grids.Computer Graphics Forum, 12(1):27--32.Google Scholar
Index Terms
- An alternate line drawing algorithm on hexagonal grid
Recommendations
Firefighting on the hexagonal grid
AbstractThe firefighter problem with k firefighters on an infinite graph G is an iterative graph process, defined as follows: Suppose a fire breaks out at a given vertex v ∈ V ( G ) on Turn 1. On each subsequent even turn, k firefighters ...
Programmable rendering of line drawing from 3D scenes
This article introduces a programmable approach to nonphotorealistic line drawings from 3D models, inspired by programmable shaders in traditional rendering. This approach relies on the assumption generally made in NPR that style attributes (color, ...
Solid Geometric Object Reconstruction from Single Line Drawing Image
GRAPP 2015: Proceedings of the 10th International Conference on Computer Graphics Theory and ApplicationsWe present a robust method to reconstruct solid geometric object from single line drawing image taken from the geometric books. Unlike most of the existing methods which require perfect and complete sketches of the line drawings as the inputs, our ...
Comments