-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathCG.java
More file actions
214 lines (192 loc) · 5.8 KB
/
CG.java
File metadata and controls
214 lines (192 loc) · 5.8 KB
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package cg;
import java.awt.*;
import javax.swing.*;
import java.lang.*;
import java.util.*;
/**
*
* @author Rohit
*/
public class CG extends JFrame{
int no_vert = 5;
int [][] vert = new int[no_vert][4];
double [] slope = new double [no_vert];
Vector x_inter = new Vector();
/**
* @param args the command line arguments
*/
public void delay()
{
try
{
Thread.sleep(2);
}
catch(Throwable e)
{
System.out.println(e.getMessage());
}
}
int in_or_out(int y,int y1,int y2)
{
if((y1-y)*(y2-y)>0)
return 1;
else
return 0;
}
int ret_y1(int y,int m,int b)
{
int temp;
temp = (y-b)/m;
return temp;
}
public static void sortbyColumn(int arr[][], int col1,int col2, int col3)
{
Arrays.sort(arr, new Comparator<int[]>() {
@Override
public int compare(final int[] entry1,
final int[] entry2) {
// To sort in descending order revert
// the '>' Operator
if (entry1[col1] < entry2[col1])
return 1;
else if((entry1[col1] == entry2[col1])&&(entry1[col2] < entry2[col2]))
return 1;
else if((entry1[col1] == entry2[col1])&&(entry1[col2] == entry2[col2])&&(entry1[col3] > entry2[col3]))
return 1;
else
return -1;
}
}); // End of function call sort().
}
double inv_slope(int x1,int y1, int x2, int y2)
{
return Math.round(((double)x2-(double)x1)/((double)y2-(double)y1)*100.0)/100.0;
//return m;
}
void arrange()
{
int i;
for(i=0;i<no_vert;i++)
{
if(vert[i][1]<vert[i][3])
{
int temp;
temp = vert[i][1];
vert[i][1] = vert[i][3];
vert[i][3] = temp;
temp = vert[i][0];
vert[i][0] = vert[i][2];
vert[i][2] = temp;
}
}
}
public void paint(Graphics g)
{
/* g.setColor(Color.red);
g.drawLine(400, 400, 700, 700);
g.drawLine(400, 400, 100, 700);
g.drawLine(100,700,700,700);
int m1 = 1;
int m2 = -1;
int i;
int temp1,temp2;
g.setColor(Color.GREEN);
for(i=400;i<700;i++)
{
temp1 = ret_y1(i,1,0);
temp2 = ret_y1(i,-1,800);
delay();
g.drawLine(temp1, i, temp2, i);
}*/
vert[0][0] = 100;
vert[0][1] = 100;
vert[1][0] = 300;
vert[1][1] = 400;
vert[2][0] = 600;
vert[2][1] = 500;
vert[3][0] = 300;
vert[3][1] = 600;
vert[4][0] = 100;
vert[4][1] = 900;
vert[4][2] = 100;
vert[4][3] = 100;
vert[0][2] = 300;
vert[0][3] = 400;
vert[1][2] = 600;
vert[1][3] = 500;
vert[2][2] = 300;
vert[2][3] = 600;
vert[3][2] = 100;
vert[3][3] = 900;
g.setColor(Color.BLUE);
int i;
for(i=0;i<no_vert;i++)
{
}
arrange();
sortbyColumn(vert, 1,3,2);
/*System.out.println(vert[0][0]);
System.out.println(vert[0][1]);
System.out.println(vert[0][2]);
System.out.println(vert[0][3]);
double x = (double)(2/3);*/
for(i=0;i<no_vert;i++)
{
g.drawLine(vert[i][0],vert[i][1],vert[i][2],vert[i][3]);
System.out.println();
System.out.print(" "+vert[i][0]);
System.out.print(" "+vert[i][1]);
System.out.print(" "+vert[i][2]);
System.out.print(" "+vert[i][3]);
slope[i] = inv_slope(vert[i][0],vert[i][1],vert[i][2],vert[i][3]);
System.out.print(" "+slope[i]);
}
int y_max = vert[0][1];
int y_min = vert[4][3];
System.out.println(" "+y_max+" "+y_min );
System.out.println();
g.setColor(Color.GREEN);
int j;
for(i = y_max-1;i>y_min;i--)
{
System.out.print(" "+i);
for(j=0;j<no_vert;j++)
{
//System.out.println("Hello");
if(i<=vert[j][1]&&i>vert[j][3])
{
int xinet;
xinet = (int)((slope[j]*(i-vert[j][1]))+vert[j][0]);
System.out.print(" "+xinet);
//System.out.println("Hello");
x_inter.add(xinet);
}
}
System.out.println();
Collections.sort(x_inter);
//System.out.println(x_inter.size());
int k;
if(!x_inter.isEmpty())
{
for(k=0;k<1;k++)
{
g.drawLine((int)x_inter.get(k),i ,(int) x_inter.get(k+1), i);
delay();
}
x_inter.clear();
}
}
}
public static void main(String[] args) {
CG obj = new CG();
obj.setTitle("Scan Fill");
obj.setSize(1920, 1080);
obj.setVisible(true);
//obj.setBackground(Color.GRAY);
}
}