An Analysis of Scan Converting a Line with Multi Symmetry

Abstract

Line is a very important primitive in computer graphics. In this paper we analyze and discussan algorithm that exploits the multi symmetry present in certain line segments during scan conversion.This feature is implemented with the simple technique of direct line equation; digital differentiation analyzer (DDA) algorithm and the floating-point operation free Bresenham's Algorithm. The benefit of exploiting this feature is clearly seen in the test results. Test results also show that by exploiting this feature, execution times of all these algorithms are very close, as the variations in these algorithms work for very small fraction of the line and the rest of the line is simply replicated from this pre-computation.

Voxelization Parallelism Using CUDA Architecture

“…Therefore we will focus on explaining 3D scan conversion only.In such processes the speed is required in generatingvoxels; some researches accelerated the operation using the standard Bresenham algorithm that has been adopted for a long time [3], [4], [5] and [6]. While other researches tried to use other algorithms like DDA [7], [8]and [9]. In [3], the early 3D version of Bresenham algorithm has been proposed,the algorithm is only implemented as Simulink using C programming and the assembly language.…”

“…Another set of works accelerated the DDA algorithm for line scan conversion,A multi symmetry, in certain type of lines, is exploited to parallelize the scan conversion algorithms [7], where the line is divided into equal lengths divisions, The algorithm was proposed to compute only the first division, and the other segments simply repeated from this precomputation. However, this work has been applied on certain line orientation (endpoints) and the overall performance depends on the probability of a line having multi symmetry.In 2011, a 3D DDA algorithm has been implemented using FPGA [8].…”