Designing a Novel Algorithm for Drawing a Kappa Curve Using Bresenham’s Approach 

Bresenham’s approach is a classical approach for developing different algorithms. It has already been applied to draw curves like lines, circles, ellipses, parabolas, and hyperbolas. Traditionally, the Kappa curve- Cartesian, parametric, and polar equations draw a mathematical curve. All these three approaches are plagued with some inherent problems. For instance, we can’t isolate y from its Cartesian equation if we want to draw it on the display by using the Cartesian equation. Further, both the parametric and polar equations of the Kappa curve contain trigonometric functions which are time-consuming and, of course, run counter to the spirit of interactivity. The figure drawn through these approaches contains inter-pixel spacing. Our proposed algorithm using Bresenham’s approach will avoid this spacing and hence the quality of the curve will improve. 

[1]   Bhatnagar, T., et al. (2023). Pixelated Interactions: Exploring Pixel Art for Graphical Primitives on a Pin Array Tactile Display. Proceedings of the 2023 ACM Designing Interactive Systems Conference.

[2]  Blázquez-Salcedo, J. L., et al. (2020). "Polar quasinormal modes of the scalarized Einstein-Gauss-Bonnet black holes." Physical Review D 102(2): 024086.

[3]  Cao, M., et al. (2020). Midpoint distance circle generation algorithm based on midpoint circle algorithm and Bresenham circle algorithm. Journal of Physics: Conference Series, IOP Publishing.

[4]  Chang, C.-H. (2014). "Cohen's kappa for capturing discrimination." International Health 6(2): 125-129.

[5]  Mokry, J. (2016). "Recalling prerequisite material in a calculus II course to improve student success." PRIMUS 26(5): 453-465.

[6]  Nienhaus, V., et al. (2019). "Investigations on nozzle geometry in fused filament fabrication." Additive Manufacturing 28: 711-718.

[7]  Popescu, I., et al. (2021). "“Kappa” and “Kieroid” Curves Resulted as Loci." Problems of Locus Solved by Mechanisms Theory: 109-120.

[8] Prabukumar, M. and B. K. Ray (2012). "A mid-point ellipse drawing algorithm on a hexagonal grid." International Journal of Computer Graphics 3(1): 17-24.

[9]  Prabukumar, M. and B. K. Ray (2013). "An Efficient Scan Conversion of Parabola on Hexagonal Grid."

[10]                      Ray, K. and B. Ray (2011). "An algorithm for Line Drawing Using Parametric Equation." International Journal of Computer Graphics, IJCG 2(1): 9-16.

[11]                       Ray, K. S. and B. K. Ray (2011). "A method of deviation for drawing implicit curves." International Journal of Computer Graphics 2(2): 11-21.

[12]                      Walia, E. and V. Verma (2012). "A computationally efficient framework for 3D warping technique." International Journal of Computer Graphics 3(1): 1-10.

[13]                      Yi, Z., et al. (2021). "A real‐time touch control system design based on field‐programmable gate array via optimizing Bresenham algorithm for electrowetting displays." Journal of the Society for Information Display 29(7): 573-583.

[14]                      Zhang, Y.-x., et al. (2022). "Comparative analysis of DDA algorithm and Bresenham algorithm." International Journal of Intelligent Internet of Things Computing 1(4): 263-272.