Archive for the ‘CSE’ Category

Midpoint Circle Algorithm

Posted: November 6, 2011 in Computer Graphics

Implementation

#include<iostream.h>

#include<conio.h>

#include<graphics.h>

void plot(int xc,int yc,int x,int y)

{ (more…)

This article is about a graphics algorithm. For the digital implementation of a Differential Analyzer, see Digital Differential Analyzer.

In computer graphics, a hardware or software implementation of a digital differential analyzer (DDA) is used for linear interpolation of variables over an interval between start and end point. DDAs are used for rasterization of lines, triangles and polygons. In its simplest implementation the DDA algorithm (more…)

The Bresenham line algorithm is an algorithm which determines which points in an n-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points. It is commonly used to draw lines on a computer screen, as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in standard computer architectures. It is one of the earliest algorithms developed in the field of computer graphics. A minor extension to the original algorithm also deals with drawing circles. (more…)

The Borland Graphics Interface (BGI) is a collection of functions and procedures that are often called as graphical toolkit which an application program may use to solve specific graphics problem. Turbo C++ graph unit (graphics.h) provides a complete set of library consisting of over 80 graphics routines that range from bit oriented routines high level calls. (more…)