cg/scanFill.cpp at main · saqib-7/cg · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include<iostream>
#include<graphics.h>
using namespace std;
struct edge{
	int x1,y1,x2,y2,flag;
};
int main()
{
	int gd=DETECT,gm,n,i,j,k;
	struct edge ed[10],temped;
	float dx,dy,m[10],x_int[10],inter_x[10];
	int x[10],y[10],ymax=0,ymin=480,yy,temp;
	initgraph(&gd,&gm,NULL);

	cout<<"Enter the no.of vertices of the graph :";
	cin>>n;

	cout<<"Enter the vertices";
	for(i=0;i<n;i++)
	{
		cin>>x[i];
		cin>>y[i];
		if(y[i]>ymax)
			ymax=y[i];
		if(y[i]<ymin)
			ymin=y[i];
		ed[i].x1=x[i];
		ed[i].y1=y[i];
	}


	cout<<"\nEdge Information\n";
	for(i=0;i<n-1;i++)
	  {
		ed[i].x2=ed[i+1].x1;
		ed[i].y2=ed[i+1].y1;
		ed[i].flag=0;
          cout<<"("<<ed[i].x1<<", "<<ed[i].y1<<") ("<<ed[i].x2<<", "<<ed[i].y2<<")"<<endl;
	  }
          ed[i].x2=ed[0].x1;
	     ed[i].y2=ed[0].y1;
	     ed[i].flag=0;
	     cout<<"("<<ed[i].x1<<", "<<ed[i].y1<<") ("<<ed[i].x2<<", "<<ed[i].y2<<")"<<endl;


	cout<<"\nUpdated Edge Information\n";
	for(i=0;i<n;i++)
	{
		if(ed[i].y1 < ed[i].y2)
		{
			temp=ed[i].x1;
			ed[i].x1=ed[i].x2;
			ed[i].x2=temp;
			temp=ed[i].y1;
			ed[i].y1=ed[i].y2;
			ed[i].y2=temp;
		}
		cout<<"("<<ed[i].x1<<", "<<ed[i].y1<<") ("<<ed[i].x2<<", "<<ed[i].y2<<")"<<endl;
	}


	for(i=0;i<n;i++)
	{
		line(ed[i].x1, ed[i].y1,ed[i].x2,ed[i].y2);
	}


	for(i=0;i<n;i++)
	{
		dx=ed[i].x2-ed[i].x1;
		dy=ed[i].y2-ed[i].y1;
		if(dy==0)
		{
			m[i]=0;
		}
		else
		{
			m[i]=dx/dy;
		}
		inter_x[i]=ed[i].x1;
	}

	yy=ymax;

	while(yy>ymin)
	{
		for(i=0;i<n;i++)
		{
			if(yy>ed[i].y2 && yy<=ed[i].y1)
				ed[i].flag=1;
			else
				ed[i].flag=0;
		}
		j=0;
		for(i=0;i<n;i++)
		{
			if(ed[i].flag==1)
			{
				if(yy==ed[i].y1)
				{
					x_int[j]=ed[i].x1;
					j++;
                    }
				else
				{
					x_int[j]=inter_x[i]+(-m[i]);
					inter_x[i]=x_int[j];
					j++;
				}
			}
		}
		for(i=0;i<j;i++)
		{
			for(k=0;k<j-1;k++)
			{
				if(x_int[k]>x_int[k+1])
				{
					temp=(int)x_int[k];
					x_int[k]=x_int[k+1];
					x_int[k+1]=temp;
				}
			}
		}
		for(i=0;i<j;i=i+2)
		{    setcolor(GREEN);
			line((int)x_int[i],yy,(int)x_int[i+1],yy);
		}
		yy--;
		delay(50);
	}
	delay(10000);
	closegraph();
}


/*
Enter the vertices 80 20 100 80 150 60 130 200 40 250
*/