Software Listing of Author : "Chandan"
- Bresenham Circle
- License: Shareware
- Price:


Code uses Bresenham Algorithm to draw a circle, with a modification parameter to increase/decrease the step for calculation of point. Bresenham Algorithm is used to reduce the calculation needed for drawing a circle by making use of property of symmetry
- Platform: Matlab, Scripts
- Bresenham line generation
- License: Shareware
- Price:


This code uses Bresenham line generation algorithm to generate a line, with modified expression for error calculation which does not involves any division or calculation of slope of line. This parameter is however modified by same mechanism as original algorithm but with different value than actual Bresenham algorithm. This code is generalized in terms of order of input of first point followed by second point or vice versa. Also result is shown in two different form namely, the point form and line segment form. Any comments and or suggestions for improvement would be appreciated.
- Platform: Matlab, Scripts
- Ellipse generation
- License: Shareware
- Price:


Generates elliptical shapes using the symmetry computational effort is minimized.
- Platform: Matlab, Scripts
- Line Drawing by Bresenham Algorithm
- License: Shareware
- Price:


This code implements Bresenham Line Algorithm with slight modification of error term in respect of computation efficiency that it does not require any division process. Hence it is more efficient. Also it has been generalized to draw lines of any slope. Point input order is thus insignificant. I hope this code would be helpful.
- Platform: Matlab, Scripts
- Line drawing by DDA
- License: Shareware
- Price:


DDA algorithm uses fast interpolation and rounding method to implement rasterization of lines, triangle and polygons. This technique has been used here to produce a straight line.
- Platform: Matlab, Scripts
- Merge sort of Multidimensional array
- License: Shareware
- Price:


Input to the file can be given from either excel, .mat or .txt file. If array to be sorted is found to be multidimensional then further information has to be provided. There is also option for selective or collective sorting of rows or columns at a time
- Platform: Matlab, Scripts
- Mullers method for polynmial root finding
- License: Shareware
- Price:


MdoDsller's method uses three points, It constructs a parabola through these three points, and takes the intersection of the x-axis with the parabola to be the next approximation. The order of convergence of MdoDsller's method is approximately 1.84. This method could be advantageous if looking for a complex roots, since any iterates can be complex even if previous ones are real. Procedure to run the code: Press F5 or RUN, then in command window a message would be displayed- "Polynomial function of Order "n" is of type:a[1]X^n+a[2]X^(n-1)+ ..+a[n]X^1+a[n+1] Type Coeff as "[ 1 2 3 ...]" i.e Row vector form." Enter the values according to above order. If polynomial is more than 1st order, it would ask for three initial guess for iteration. Please provide with three distinct numbers or else error message would be displayed. e.g....
- Platform: Matlab, Scripts
- Newton Raphson method for Transcendental equations
- License: Shareware
- Price:


This code evaluates the root of transcendental equation with the help of Newton Raphson method with enhanced features like vanishing of differential of a function, Infinite cycling for root due to a poor initial approximation or when a root exists but differential does not. Use of symbolic Toolbox is advised.
- Platform: Matlab, Scripts
