Comparative Analysis of Bresenham-Based Algorithms for Sphere and Ellipsoid Voxelization

Abstract

The midpoint circle and ellipse drawing algorithms are fundamental in computer graphics for generating pixel representations of circles and ellipses. This thesis examines their theoretical foundations and implementation, extending these algorithms to 3D for generating spheres and ellipsoids. Detailed pseudocodes illustrate their application in rendering voxelized shapes. Figures showcasing the results of each method are included to provide visual clarity. The execution time of the algorithms is analyzed to highlight strengths and potential areas for optimization. Each algorithm's accuracy is also showcased with various radii.