Scribd
Upload
12 views7 pages

CG Practicals

The document contains a C++ program that implements two algorithms, DDA and Bresenham, for drawing lines in a graphics environment. It defines a class structure for handling pixel operations and provides a menu-driven interface for user input to draw lines based on specified coordinates. The program initializes graphics mode, processes user commands, and allows for repeated line drawing until the user chooses to exit.

Uploaded by

Sumeet Dhumal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views7 pages

CG Practicals

The document contains a C++ program that implements two algorithms, DDA and Bresenham, for drawing lines in a graphics environment. It defines a class structure for handling pixel operations and provides a menu-driven interface for user input to draw lines based on specified coordinates. The program initializes graphics mode, processes user commands, and allows for repeated line drawing until the user chooses to exit.

Uploaded by

Sumeet Dhumal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Exp 1 –

#include <iostream>
#include <graphics.h>
#include <math.h>
using namespace std;

class pixel {
public:
float x, y, length, dx, dy;
int p;
};

class pixel1 : public pixel {


public:
void DDA(float x1, float y1, float x2, float y2);
void bresen(float x1, float y1, float x2, float y2);
int sign(float x);
};

int pixel1::sign(float x) {
if (x < 0)
return -1;
else if (x == 0)
return 0;
else
return 1;
}

void pixel1::DDA(float x1, float y1, float x2, float y2) {


dx = abs(x2 - x1);
dy = abs(y2 - y1);

if (dx > dy)


length = dx;
else
length = dy;

dx = (x2 - x1) / length;


dy = (y2 - y1) / length;

x = x1 + 0.5 * sign(dx);
y = y1 + 0.5 * sign(dy);

// Drawing axes
line(0, 240, 640, 240); // X-axis
line(320, 0, 320, 480); // Y-axis

// Plotting the pixels


for (int i = 0; i < length; i++) {
x = x + dx;
y = y + dy;
putpixel(x, y, WHITE); // Plot pixel at (x, y)
}
}

void pixel1::bresen(float x1, float y1, float x2, float y2) {


int temp, exchange_flag = 0;
dx = abs(x2 - x1);
dy = abs(y2 - y1);
int s1 = sign(x2 - x1);
int s2 = sign(y2 - y1);
x = x1;
y = y1;

if (dy > dx) {


temp = dx;
dx = dy;
dy = temp;
exchange_flag = 1;
} else {
exchange_flag = 0;
}

p = 2 * dy - dx;

// Drawing axes
line(0, 240, 640, 240); // X-axis
line(320, 0, 320, 480); // Y-axis

int i = 0;
while (i <= dx) {
putpixel(abs(x), abs(y), 15); // Plot pixel at (x, y)
if (p >= 0) {
if (exchange_flag == 1)
x = x + s1;
else
y = y + s2;

p = p - 2 * dx;
}
if (exchange_flag == 1)
y = y + s2;
else
x = x + s1;

p = p + 2 * dy;
i++;
}
}

int main() {
int gd = DETECT, gm;
initgraph(&gd, &gm, NULL); // Initialize the graphics mode

pixel1 s;
float x1, y1, x2, y2;
char ans;
int ch;

do {
cout << "\n****MENU****";
cout << "\n1. DDA ";
cout << "\n2. Bresenham ";
cout << "\n3. Exit ";
cin >> ch;

switch (ch) {
case 1:
cout << "\nEnter coordinates of the line (x1, y1, x2, y2): ";
cin >> x1 >> y1 >> x2 >> y2;
x1 = x1 + 320;
y1 = 240 - y1;
x2 = x2 + 320;
y2 = 240 - y2;
s.DDA(x1, y1, x2, y2);
break;

case 2:
cout << "\nEnter coordinates of the line (x1, y1, x2, y2): ";
cin >> x1 >> y1 >> x2 >> y2;
x1 = x1 + 320;
y1 = 240 - y1;
x2 = x2 + 320;
y2 = 240 - y2;
s.bresen(x1, y1, x2, y2);
break;

case 3:
break;

default:
cout << "\nInvalid option!";
break;
}

cout << "\nDo you want to continue...(y/n): ";


cin >> ans;

} while (ans == 'y' || ans == 'Y');


closegraph(); // Close the graphics mode
return 0;
}
Output -
Exp 2 –

You might also like