Scribd
Upload
40 views2 pages

A 4 Scanline

This C++ program uses a scanline polygon filling algorithm to fill in a polygon on the screen. It defines Line and polygon_filling classes. The polygon_filling class accepts user input for the polygon coordinates, draws the outline, and implements the scanline algorithm. It finds the maximum and minimum y-values, calculates slope for each line segment, sorts intersection points by x-value for each scanline, and draws horizontal lines between intersection points from top to bottom to fill the interior of the polygon.

Uploaded by

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

A 4 Scanline

This C++ program uses a scanline polygon filling algorithm to fill in a polygon on the screen. It defines Line and polygon_filling classes. The polygon_filling class accepts user input for the polygon coordinates, draws the outline, and implements the scanline algorithm. It finds the maximum and minimum y-values, calculates slope for each line segment, sorts intersection points by x-value for each scanline, and draws horizontal lines between intersection points from top to bottom to fill the interior of the polygon.

Uploaded by

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

#include <iostream>

#include <conio.h>
#include <graphics.h>
using namespace std;

class Line
{
public:
void drawline(int x1, int y1, int x2, int y2)
{
line(x1, y1, x2, y2);
}
};

class polygon_filling : public Line


{
int xx[10], yy[10], n, inx[10], ymax, ymin;

public:
void accept()
{
int i;
cout << "Enter the Number of coordinates of Polygon:-";
cin >> n;
for (i = 0; i < n; i++)
{
cout << "\nEnter the co-ordinates of Polygon =";
cin >> xx[i];
cin >> yy[i];
}
xx[i] = xx[0];
yy[i] = yy[0];

for (i = 0; i <= n - 1; i++)


{
drawline(xx[i], yy[i], xx[i + 1], yy[i + 1]);
}
}

void scanline()
{
int i, k, temp, y;
ymax = 0;
ymin = 480;
float m[50], dx, dy;
setcolor(5);
for (i = 0; i < n; i++)
{
if (yy[i] >= ymax)
ymax = yy[i];
if (yy[i] <= ymin)
ymin = yy[i];

dx = xx[i + 1] - xx[i];
dy = yy[i + 1] - yy[i];

if (dx == 0)
m[i] = 0;
if (dy == 0)
m[i] = 1;

if (dx != 0 && dy != 0)
m[i] = (float)(dx / dy);
}

for (y = ymax; y >= ymin; y--)


{
int cnt = 0;
for (i = 0; i < n; i++)
{
if ((yy[i] > y && yy[i + 1] <= y) || (yy[i] <= y && yy[i + 1] > y))
{
inx[cnt] = (xx[i] + (m[i] * (y - yy[i])));
cnt++;
}
}
for (k = 0; k < cnt - 1; k++)
{
for (i = 0; i < cnt - 1; i++)
{
if (inx[i] > inx[i + 1])
{
temp = inx[i];
inx[i] = inx[i + 1];
inx[i + 1] = temp;
}
}
}

for (i = 0; i < cnt - 1; i += 2)


{
drawline(inx[i], y, inx[i + 1], y);
delay(100);
}

}
}
};

int main()
{
int gd = DETECT, gm;

initgraph(&gd, &gm, NULL);

polygon_filling obj;
obj.accept();

obj.scanline();

getch();
closegraph();

return 0;
}

You might also like