├── BRD.pde
├── Image_Processing.pde
├── LICENSE
├── Quad_Tree.pde
├── README.md
├── Rect_Class.pde
├── UI.pde
├── binaries
    ├── DISCLAIMER
    ├── application.windows32.rar
    └── application.windows64.rar
├── data
    ├── 0.txt
    ├── 6fvwkqsr.jpg
    ├── alongruss.jpg
    └── arial.ttf
└── pcb_design_020.pde


/BRD.pde:
--------------------------------------------------------------------------------
  1 | void setup_BRD_file() {
  2 |   file_location = generate_file_location();
  3 |   BRD_writer = createWriter(file_location+"\\"+"positions.brd");
  4 | }
  5 | 
  6 | String generate_file_location() {
  7 |   String temp_location = sketchPath()+"\\exports\\set_"+generate_timestamp();
  8 |   return temp_location;
  9 | }
 10 | 
 11 | String  generate_timestamp() {
 12 |   String temp_timestamp = "";
 13 |   temp_timestamp="h"+nf(hour(), 2)+"m"+nf(minute(), 2)+"s"+nf(second(), 2);
 14 |   return temp_timestamp;
 15 | }
 16 | 
 17 | void export_BRD() {
 18 |   setup_BRD_file();
 19 |   write_BRD_prefix();
 20 | 
 21 |   //30 29 01 16 21 22
 22 |   if (rect_array[0]!=null) {
 23 |     for (int j=0; j<rect_array[0].length; j++) {
 24 |       write_BRD_rect_at(30, rect_array[0][j].x, rect_array[0][j].y, rect_array[0][j].w, rect_array[0][j].h);
 25 |     }
 26 |   }
 27 | 
 28 |   if (rect_array[1]!=null) {
 29 |     for (int j=0; j<rect_array[1].length; j++) {
 30 |       write_BRD_rect_at(29, rect_array[1][j].x, rect_array[1][j].y, rect_array[1][j].w, rect_array[1][j].h);
 31 |     }
 32 |   }
 33 | 
 34 |   if (rect_array[2]!=null) {
 35 |     for (int j=0; j<rect_array[2].length; j++) {
 36 |       write_BRD_rect_at(1, rect_array[2][j].x, rect_array[2][j].y, rect_array[2][j].w, rect_array[2][j].h);
 37 |     }
 38 |   }
 39 | 
 40 |   if (rect_array[3]!=null) {
 41 |     for (int j=0; j<rect_array[3].length; j++) {
 42 |       write_BRD_rect_at(16, rect_array[3][j].x, rect_array[3][j].y, rect_array[3][j].w, rect_array[3][j].h);
 43 |     }
 44 |   }
 45 | 
 46 |   if (rect_array[4]!=null) {
 47 |     for (int j=0; j<rect_array[4].length; j++) {
 48 |       write_BRD_rect_at(21, rect_array[4][j].x, rect_array[4][j].y, rect_array[4][j].w, rect_array[4][j].h);
 49 |     }
 50 |   }
 51 | 
 52 |   if (rect_array[5]!=null) {
 53 |     for (int j=0; j<rect_array[5].length; j++) {
 54 |       write_BRD_rect_at(22, rect_array[5][j].x, rect_array[5][j].y, rect_array[5][j].w, rect_array[5][j].h);
 55 |     }
 56 |   }
 57 | 
 58 | 
 59 |   write_BRD_suffix();
 60 |   BRD_close();
 61 | }
 62 | 
 63 | void write_BRD_rect_at(int _layer, float _xpos, float _ypos, float _width, float _height) {
 64 |   String output_line;
 65 |   output_line = ("<rectangle x1=\""+_xpos*BRD_scalar+"\" y1=\""+_ypos*BRD_scalar+"\" x2=\""+(_xpos+_width)*BRD_scalar+"\" y2=\""+(_ypos+_height)*BRD_scalar+"\" layer=\""+_layer+"\"/>"+"\n");
 66 |   BRD_writer.println(output_line);
 67 | }
 68 | 
 69 | void write_BRD_prefix() {
 70 |   BRD_writer.println("<?xml version=\"1.0\" encoding=\"utf-8\"?>");
 71 |   BRD_writer.println("<!DOCTYPE eagle SYSTEM \"eagle.dtd\">");
 72 |   BRD_writer.println("<eagle version=\"7.6.0\">");
 73 |   BRD_writer.println("<drawing>");
 74 |   BRD_writer.println("<settings>");
 75 |   BRD_writer.println("<setting alwaysvectorfont=\"no\"/>");
 76 |   BRD_writer.println("<setting verticaltext=\"up\"/>");
 77 |   BRD_writer.println("</settings>");
 78 |   BRD_writer.println("<grid distance=\"0.05\" unitdist=\"inch\" unit=\"inch\" style=\"lines\" multiple=\"1\" display=\"no\" altdistance=\"0.025\" altunitdist=\"inch\" altunit=\"inch\"/>");
 79 |   BRD_writer.println("<layers>");
 80 |   BRD_writer.println("<layer number=\"1\" name=\"Top\" color=\"4\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 81 |   BRD_writer.println("<layer number=\"16\" name=\"Bottom\" color=\"1\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 82 |   BRD_writer.println("<layer number=\"17\" name=\"Pads\" color=\"2\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 83 |   BRD_writer.println("<layer number=\"18\" name=\"Vias\" color=\"2\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 84 |   BRD_writer.println("<layer number=\"19\" name=\"Unrouted\" color=\"6\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 85 |   BRD_writer.println("<layer number=\"20\" name=\"Dimension\" color=\"15\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 86 |   BRD_writer.println("<layer number=\"21\" name=\"tPlace\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 87 |   BRD_writer.println("<layer number=\"22\" name=\"bPlace\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 88 |   BRD_writer.println("<layer number=\"23\" name=\"tOrigins\" color=\"15\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 89 |   BRD_writer.println("<layer number=\"24\" name=\"bOrigins\" color=\"15\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 90 |   BRD_writer.println("<layer number=\"25\" name=\"tNames\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 91 |   BRD_writer.println("<layer number=\"26\" name=\"bNames\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 92 |   BRD_writer.println("<layer number=\"27\" name=\"tValues\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 93 |   BRD_writer.println("<layer number=\"28\" name=\"bValues\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
 94 |   BRD_writer.println("<layer number=\"29\" name=\"tStop\" color=\"7\" fill=\"3\" visible=\"no\" active=\"yes\"/>");
 95 |   BRD_writer.println("<layer number=\"30\" name=\"bStop\" color=\"7\" fill=\"6\" visible=\"no\" active=\"yes\"/>");
 96 |   BRD_writer.println("<layer number=\"31\" name=\"tCream\" color=\"7\" fill=\"4\" visible=\"no\" active=\"yes\"/>");
 97 |   BRD_writer.println("<layer number=\"32\" name=\"bCream\" color=\"7\" fill=\"5\" visible=\"no\" active=\"yes\"/>");
 98 |   BRD_writer.println("<layer number=\"33\" name=\"tFinish\" color=\"6\" fill=\"3\" visible=\"no\" active=\"yes\"/>");
 99 |   BRD_writer.println("<layer number=\"34\" name=\"bFinish\" color=\"6\" fill=\"6\" visible=\"no\" active=\"yes\"/>");
100 |   BRD_writer.println("<layer number=\"35\" name=\"tGlue\" color=\"7\" fill=\"4\" visible=\"no\" active=\"yes\"/>");
101 |   BRD_writer.println("<layer number=\"36\" name=\"bGlue\" color=\"7\" fill=\"5\" visible=\"no\" active=\"yes\"/>");
102 |   BRD_writer.println("<layer number=\"37\" name=\"tTest\" color=\"7\" fill=\"1\" visible=\"no\" active=\"yes\"/>");
103 |   BRD_writer.println("<layer number=\"38\" name=\"bTest\" color=\"7\" fill=\"1\" visible=\"no\" active=\"yes\"/>");
104 |   BRD_writer.println("<layer number=\"39\" name=\"tKeepout\" color=\"4\" fill=\"11\" visible=\"yes\" active=\"yes\"/>");
105 |   BRD_writer.println("<layer number=\"40\" name=\"bKeepout\" color=\"1\" fill=\"11\" visible=\"yes\" active=\"yes\"/>");
106 |   BRD_writer.println("<layer number=\"41\" name=\"tRestrict\" color=\"4\" fill=\"10\" visible=\"yes\" active=\"yes\"/>");
107 |   BRD_writer.println("<layer number=\"42\" name=\"bRestrict\" color=\"1\" fill=\"10\" visible=\"yes\" active=\"yes\"/>");
108 |   BRD_writer.println("<layer number=\"43\" name=\"vRestrict\" color=\"2\" fill=\"10\" visible=\"yes\" active=\"yes\"/>");
109 |   BRD_writer.println("<layer number=\"44\" name=\"Drills\" color=\"7\" fill=\"1\" visible=\"no\" active=\"yes\"/>");
110 |   BRD_writer.println("<layer number=\"45\" name=\"Holes\" color=\"7\" fill=\"1\" visible=\"no\" active=\"yes\"/>");
111 |   BRD_writer.println("<layer number=\"46\" name=\"Milling\" color=\"3\" fill=\"1\" visible=\"no\" active=\"yes\"/>");
112 |   BRD_writer.println("<layer number=\"47\" name=\"Measures\" color=\"7\" fill=\"1\" visible=\"no\" active=\"yes\"/>");
113 |   BRD_writer.println("<layer number=\"48\" name=\"Document\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
114 |   BRD_writer.println("<layer number=\"49\" name=\"Reference\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
115 |   BRD_writer.println("<layer number=\"51\" name=\"tDocu\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
116 |   BRD_writer.println("<layer number=\"52\" name=\"bDocu\" color=\"7\" fill=\"1\" visible=\"yes\" active=\"yes\"/>");
117 |   BRD_writer.println("</layers>");
118 |   BRD_writer.println("<board>");
119 |   BRD_writer.println("<plain>");
120 | }
121 | 
122 | void write_BRD_suffix() {
123 |   BRD_writer.println("</plain>");
124 |   BRD_writer.println("<libraries>");
125 |   BRD_writer.println("</libraries>");
126 |   BRD_writer.println("<attributes>");
127 |   BRD_writer.println("</attributes>");
128 |   BRD_writer.println("<variantdefs>");
129 |   BRD_writer.println("</variantdefs>");
130 |   BRD_writer.println("<classes>");
131 |   BRD_writer.println("<class number=\"0\" name=\"default\" width=\"0\" drill=\"0\">");
132 |   BRD_writer.println("</class>");
133 |   BRD_writer.println("</classes>");
134 |   BRD_writer.println("<designrules name=\"default\">");
135 |   BRD_writer.println("<description language=\"en\">&lt;b&gt;EAGLE Design Rules&lt;/b&gt;");
136 |   BRD_writer.println("&lt;p&gt;");
137 |   BRD_writer.println("The default Design Rules have been set to cover");
138 |   BRD_writer.println("a wide range of applications. Your particular design");
139 |   BRD_writer.println("may have different requirements, so please make the");
140 |   BRD_writer.println("necessary adjustments and save your customized");
141 |   BRD_writer.println("design rules under a new name.");
142 |   BRD_writer.println("</description>");
143 |   BRD_writer.println("<param name=\"layerSetup\" value=\"(1*16)\"/>");
144 |   BRD_writer.println("<param name=\"mtCopper\" value=\"0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm 0.035mm\"/>");
145 |   BRD_writer.println("<param name=\"mtIsolate\" value=\"1.5mm 0.15mm 0.2mm 0.15mm 0.2mm 0.15mm 0.2mm 0.15mm 0.2mm 0.15mm 0.2mm 0.15mm 0.2mm 0.15mm 0.2mm\"/>");
146 |   BRD_writer.println("<param name=\"mdWireWire\" value=\"8mil\"/>");
147 |   BRD_writer.println("<param name=\"mdWirePad\" value=\"8mil\"/>");
148 |   BRD_writer.println("<param name=\"mdWireVia\" value=\"8mil\"/>");
149 |   BRD_writer.println("<param name=\"mdPadPad\" value=\"8mil\"/>");
150 |   BRD_writer.println("<param name=\"mdPadVia\" value=\"8mil\"/>");
151 |   BRD_writer.println("<param name=\"mdViaVia\" value=\"8mil\"/>");
152 |   BRD_writer.println("<param name=\"mdSmdPad\" value=\"8mil\"/>");
153 |   BRD_writer.println("<param name=\"mdSmdVia\" value=\"8mil\"/>");
154 |   BRD_writer.println("<param name=\"mdSmdSmd\" value=\"8mil\"/>");
155 |   BRD_writer.println("<param name=\"mdViaViaSameLayer\" value=\"8mil\"/>");
156 |   BRD_writer.println("<param name=\"mnLayersViaInSmd\" value=\"2\"/>");
157 |   BRD_writer.println("<param name=\"mdCopperDimension\" value=\"40mil\"/>");
158 |   BRD_writer.println("<param name=\"mdDrill\" value=\"8mil\"/>");
159 |   BRD_writer.println("<param name=\"mdSmdStop\" value=\"0mil\"/>");
160 |   BRD_writer.println("<param name=\"msWidth\" value=\"10mil\"/>");
161 |   BRD_writer.println("<param name=\"msDrill\" value=\"0.6mm\"/>");
162 |   BRD_writer.println("<param name=\"msMicroVia\" value=\"9.99mm\"/>");
163 |   BRD_writer.println("<param name=\"msBlindViaRatio\" value=\"0.5\"/>");
164 |   BRD_writer.println("<param name=\"rvPadTop\" value=\"0.25\"/>");
165 |   BRD_writer.println("<param name=\"rvPadInner\" value=\"0.25\"/>");
166 |   BRD_writer.println("<param name=\"rvPadBottom\" value=\"0.25\"/>");
167 |   BRD_writer.println("<param name=\"rvViaOuter\" value=\"0.25\"/>");
168 |   BRD_writer.println("<param name=\"rvViaInner\" value=\"0.25\"/>");
169 |   BRD_writer.println("<param name=\"rvMicroViaOuter\" value=\"0.25\"/>");
170 |   BRD_writer.println("<param name=\"rvMicroViaInner\" value=\"0.25\"/>");
171 |   BRD_writer.println("<param name=\"rlMinPadTop\" value=\"10mil\"/>");
172 |   BRD_writer.println("<param name=\"rlMaxPadTop\" value=\"20mil\"/>");
173 |   BRD_writer.println("<param name=\"rlMinPadInner\" value=\"10mil\"/>");
174 |   BRD_writer.println("<param name=\"rlMaxPadInner\" value=\"20mil\"/>");
175 |   BRD_writer.println("<param name=\"rlMinPadBottom\" value=\"10mil\"/>");
176 |   BRD_writer.println("<param name=\"rlMaxPadBottom\" value=\"20mil\"/>");
177 |   BRD_writer.println("<param name=\"rlMinViaOuter\" value=\"8mil\"/>");
178 |   BRD_writer.println("<param name=\"rlMaxViaOuter\" value=\"20mil\"/>");
179 |   BRD_writer.println("<param name=\"rlMinViaInner\" value=\"8mil\"/>");
180 |   BRD_writer.println("<param name=\"rlMaxViaInner\" value=\"20mil\"/>");
181 |   BRD_writer.println("<param name=\"rlMinMicroViaOuter\" value=\"4mil\"/>");
182 |   BRD_writer.println("<param name=\"rlMaxMicroViaOuter\" value=\"20mil\"/>");
183 |   BRD_writer.println("<param name=\"rlMinMicroViaInner\" value=\"4mil\"/>");
184 |   BRD_writer.println("<param name=\"rlMaxMicroViaInner\" value=\"20mil\"/>");
185 |   BRD_writer.println("<param name=\"psTop\" value=\"-1\"/>");
186 |   BRD_writer.println("<param name=\"psBottom\" value=\"-1\"/>");
187 |   BRD_writer.println("<param name=\"psFirst\" value=\"-1\"/>");
188 |   BRD_writer.println("<param name=\"psElongationLong\" value=\"100\"/>");
189 |   BRD_writer.println("<param name=\"psElongationOffset\" value=\"100\"/>");
190 |   BRD_writer.println("<param name=\"mvStopFrame\" value=\"1\"/>");
191 |   BRD_writer.println("<param name=\"mvCreamFrame\" value=\"0\"/>");
192 |   BRD_writer.println("<param name=\"mlMinStopFrame\" value=\"4mil\"/>");
193 |   BRD_writer.println("<param name=\"mlMaxStopFrame\" value=\"4mil\"/>");
194 |   BRD_writer.println("<param name=\"mlMinCreamFrame\" value=\"0mil\"/>");
195 |   BRD_writer.println("<param name=\"mlMaxCreamFrame\" value=\"0mil\"/>");
196 |   BRD_writer.println("<param name=\"mlViaStopLimit\" value=\"0mil\"/>");
197 |   BRD_writer.println("<param name=\"srRoundness\" value=\"0\"/>");
198 |   BRD_writer.println("<param name=\"srMinRoundness\" value=\"0mil\"/>");
199 |   BRD_writer.println("<param name=\"srMaxRoundness\" value=\"0mil\"/>");
200 |   BRD_writer.println("<param name=\"slThermalIsolate\" value=\"10mil\"/>");
201 |   BRD_writer.println("<param name=\"slThermalsForVias\" value=\"0\"/>");
202 |   BRD_writer.println("<param name=\"dpMaxLengthDifference\" value=\"10mm\"/>");
203 |   BRD_writer.println("<param name=\"dpGapFactor\" value=\"2.5\"/>");
204 |   BRD_writer.println("<param name=\"checkGrid\" value=\"0\"/>");
205 |   BRD_writer.println("<param name=\"checkAngle\" value=\"0\"/>");
206 |   BRD_writer.println("<param name=\"checkFont\" value=\"1\"/>");
207 |   BRD_writer.println("<param name=\"checkRestrict\" value=\"1\"/>");
208 |   BRD_writer.println("<param name=\"useDiameter\" value=\"13\"/>");
209 |   BRD_writer.println("<param name=\"maxErrors\" value=\"999999\"/>");
210 |   BRD_writer.println("</designrules>");
211 |   BRD_writer.println("<autorouter>");
212 |   BRD_writer.println("<pass name=\"Default\">");
213 |   BRD_writer.println("<param name=\"RoutingGrid\" value=\"50mil\"/>");
214 |   BRD_writer.println("<param name=\"AutoGrid\" value=\"1\"/>");
215 |   BRD_writer.println("<param name=\"Efforts\" value=\"0\"/>");
216 |   BRD_writer.println("<param name=\"TopRouterVariant\" value=\"1\"/>");
217 |   BRD_writer.println("<param name=\"tpViaShape\" value=\"round\"/>");
218 |   BRD_writer.println("<param name=\"PrefDir.1\" value=\"a\"/>");
219 |   BRD_writer.println("<param name=\"PrefDir.2\" value=\"0\"/>");
220 |   BRD_writer.println("<param name=\"PrefDir.3\" value=\"0\"/>");
221 |   BRD_writer.println("<param name=\"PrefDir.4\" value=\"0\"/>");
222 |   BRD_writer.println("<param name=\"PrefDir.5\" value=\"0\"/>");
223 |   BRD_writer.println("<param name=\"PrefDir.6\" value=\"0\"/>");
224 |   BRD_writer.println("<param name=\"PrefDir.7\" value=\"0\"/>");
225 |   BRD_writer.println("<param name=\"PrefDir.8\" value=\"0\"/>");
226 |   BRD_writer.println("<param name=\"PrefDir.9\" value=\"0\"/>");
227 |   BRD_writer.println("<param name=\"PrefDir.10\" value=\"0\"/>");
228 |   BRD_writer.println("<param name=\"PrefDir.11\" value=\"0\"/>");
229 |   BRD_writer.println("<param name=\"PrefDir.12\" value=\"0\"/>");
230 |   BRD_writer.println("<param name=\"PrefDir.13\" value=\"0\"/>");
231 |   BRD_writer.println("<param name=\"PrefDir.14\" value=\"0\"/>");
232 |   BRD_writer.println("<param name=\"PrefDir.15\" value=\"0\"/>");
233 |   BRD_writer.println("<param name=\"PrefDir.16\" value=\"a\"/>");
234 |   BRD_writer.println("<param name=\"cfVia\" value=\"8\"/>");
235 |   BRD_writer.println("<param name=\"cfNonPref\" value=\"5\"/>");
236 |   BRD_writer.println("<param name=\"cfChangeDir\" value=\"2\"/>");
237 |   BRD_writer.println("<param name=\"cfOrthStep\" value=\"2\"/>");
238 |   BRD_writer.println("<param name=\"cfDiagStep\" value=\"3\"/>");
239 |   BRD_writer.println("<param name=\"cfExtdStep\" value=\"0\"/>");
240 |   BRD_writer.println("<param name=\"cfBonusStep\" value=\"1\"/>");
241 |   BRD_writer.println("<param name=\"cfMalusStep\" value=\"1\"/>");
242 |   BRD_writer.println("<param name=\"cfPadImpact\" value=\"4\"/>");
243 |   BRD_writer.println("<param name=\"cfSmdImpact\" value=\"4\"/>");
244 |   BRD_writer.println("<param name=\"cfBusImpact\" value=\"0\"/>");
245 |   BRD_writer.println("<param name=\"cfHugging\" value=\"3\"/>");
246 |   BRD_writer.println("<param name=\"cfAvoid\" value=\"4\"/>");
247 |   BRD_writer.println("<param name=\"cfPolygon\" value=\"10\"/>");
248 |   BRD_writer.println("<param name=\"cfBase.1\" value=\"0\"/>");
249 |   BRD_writer.println("<param name=\"cfBase.2\" value=\"1\"/>");
250 |   BRD_writer.println("<param name=\"cfBase.3\" value=\"1\"/>");
251 |   BRD_writer.println("<param name=\"cfBase.4\" value=\"1\"/>");
252 |   BRD_writer.println("<param name=\"cfBase.5\" value=\"1\"/>");
253 |   BRD_writer.println("<param name=\"cfBase.6\" value=\"1\"/>");
254 |   BRD_writer.println("<param name=\"cfBase.7\" value=\"1\"/>");
255 |   BRD_writer.println("<param name=\"cfBase.8\" value=\"1\"/>");
256 |   BRD_writer.println("<param name=\"cfBase.9\" value=\"1\"/>");
257 |   BRD_writer.println("<param name=\"cfBase.10\" value=\"1\"/>");
258 |   BRD_writer.println("<param name=\"cfBase.11\" value=\"1\"/>");
259 |   BRD_writer.println("<param name=\"cfBase.12\" value=\"1\"/>");
260 |   BRD_writer.println("<param name=\"cfBase.13\" value=\"1\"/>");
261 |   BRD_writer.println("<param name=\"cfBase.14\" value=\"1\"/>");
262 |   BRD_writer.println("<param name=\"cfBase.15\" value=\"1\"/>");
263 |   BRD_writer.println("<param name=\"cfBase.16\" value=\"0\"/>");
264 |   BRD_writer.println("<param name=\"mnVias\" value=\"20\"/>");
265 |   BRD_writer.println("<param name=\"mnSegments\" value=\"9999\"/>");
266 |   BRD_writer.println("<param name=\"mnExtdSteps\" value=\"9999\"/>");
267 |   BRD_writer.println("<param name=\"mnRipupLevel\" value=\"10\"/>");
268 |   BRD_writer.println("<param name=\"mnRipupSteps\" value=\"100\"/>");
269 |   BRD_writer.println("<param name=\"mnRipupTotal\" value=\"100\"/>");
270 |   BRD_writer.println("</pass>");
271 |   BRD_writer.println("<pass name=\"Follow-me\" refer=\"Default\" active=\"yes\">");
272 |   BRD_writer.println("</pass>");
273 |   BRD_writer.println("<pass name=\"Busses\" refer=\"Default\" active=\"yes\">");
274 |   BRD_writer.println("<param name=\"cfNonPref\" value=\"4\"/>");
275 |   BRD_writer.println("<param name=\"cfBusImpact\" value=\"4\"/>");
276 |   BRD_writer.println("<param name=\"cfHugging\" value=\"0\"/>");
277 |   BRD_writer.println("<param name=\"mnVias\" value=\"0\"/>");
278 |   BRD_writer.println("</pass>");
279 |   BRD_writer.println("<pass name=\"Route\" refer=\"Default\" active=\"yes\">");
280 |   BRD_writer.println("</pass>");
281 |   BRD_writer.println("<pass name=\"Optimize1\" refer=\"Default\" active=\"yes\">");
282 |   BRD_writer.println("<param name=\"cfVia\" value=\"99\"/>");
283 |   BRD_writer.println("<param name=\"cfExtdStep\" value=\"10\"/>");
284 |   BRD_writer.println("<param name=\"cfHugging\" value=\"1\"/>");
285 |   BRD_writer.println("<param name=\"mnExtdSteps\" value=\"1\"/>");
286 |   BRD_writer.println("<param name=\"mnRipupLevel\" value=\"0\"/>");
287 |   BRD_writer.println("</pass>");
288 |   BRD_writer.println("<pass name=\"Optimize2\" refer=\"Optimize1\" active=\"yes\">");
289 |   BRD_writer.println("<param name=\"cfNonPref\" value=\"0\"/>");
290 |   BRD_writer.println("<param name=\"cfChangeDir\" value=\"6\"/>");
291 |   BRD_writer.println("<param name=\"cfExtdStep\" value=\"0\"/>");
292 |   BRD_writer.println("<param name=\"cfBonusStep\" value=\"2\"/>");
293 |   BRD_writer.println("<param name=\"cfMalusStep\" value=\"2\"/>");
294 |   BRD_writer.println("<param name=\"cfPadImpact\" value=\"2\"/>");
295 |   BRD_writer.println("<param name=\"cfSmdImpact\" value=\"2\"/>");
296 |   BRD_writer.println("<param name=\"cfHugging\" value=\"0\"/>");
297 |   BRD_writer.println("</pass>");
298 |   BRD_writer.println("<pass name=\"Optimize3\" refer=\"Optimize2\" active=\"yes\">");
299 |   BRD_writer.println("<param name=\"cfChangeDir\" value=\"8\"/>");
300 |   BRD_writer.println("<param name=\"cfPadImpact\" value=\"0\"/>");
301 |   BRD_writer.println("<param name=\"cfSmdImpact\" value=\"0\"/>");
302 |   BRD_writer.println("</pass>");
303 |   BRD_writer.println("<pass name=\"Optimize4\" refer=\"Optimize3\" active=\"yes\">");
304 |   BRD_writer.println("<param name=\"cfChangeDir\" value=\"25\"/>");
305 |   BRD_writer.println("</pass>");
306 |   BRD_writer.println("</autorouter>");
307 |   BRD_writer.println("<elements>");
308 |   BRD_writer.println("</elements>");
309 |   BRD_writer.println("<signals>");
310 |   BRD_writer.println("</signals>");
311 |   BRD_writer.println("</board>");
312 |   BRD_writer.println("</drawing>");
313 |   BRD_writer.println("</eagle>");
314 | }
315 | 
316 | void BRD_close() {
317 |   BRD_writer.flush(); // Writes the remaining data to the file
318 |   BRD_writer.close(); // Finishes the file
319 | }


--------------------------------------------------------------------------------
/Image_Processing.pde:
--------------------------------------------------------------------------------
  1 | void copy_input_image_to_resized() {
  2 |   resized_input_image = createImage(DEFAULT_IMAGE_WIDTH, DEFAULT_IMAGE_HEIGHT, RGB);
  3 |   resized_input_image.copy(input_image, 0, 0, input_image.width, input_image.height, 0, 0, resized_input_image.width, resized_input_image.height);
  4 | }
  5 | 
  6 | void copy_resized_image_to_brightness_layers() {
  7 |   for (int i=0; i<brightness_layer_images.length; i++) {
  8 |     brightness_layer_images[i] = createImage(DEFAULT_IMAGE_WIDTH, DEFAULT_IMAGE_HEIGHT, RGB);
  9 |     brightness_layer_images[i].copy(resized_input_image, 0, 0, resized_input_image.width, resized_input_image.height, 0, 0, brightness_layer_images[i].width, brightness_layer_images[i].height);
 10 |   }
 11 | }
 12 | 
 13 | void init_BRD_layers() {
 14 |   for (int i=0; i<BRD_layer_images.length; i++) {
 15 |     BRD_layer_images[i] = createImage(DEFAULT_IMAGE_WIDTH, DEFAULT_IMAGE_HEIGHT, RGB);
 16 |   }
 17 | }
 18 | 
 19 | void init_output_preview() {
 20 |   output_preview_image = createImage(DEFAULT_IMAGE_WIDTH, DEFAULT_IMAGE_HEIGHT, RGB);
 21 | }
 22 | 
 23 | PImage dither(PImage _input_for_dither, float _input_value) {
 24 |    _input_for_dither.copy(resized_input_image, 0, 0, resized_input_image.width, resized_input_image.height, 0, 0, _input_for_dither.width, _input_for_dither.height);
 25 |   _input_for_dither.loadPixels();
 26 |   for (int y=0; y<_input_for_dither.height-1; y++) {
 27 |     for (int x=0; x<_input_for_dither.width-1; x++) {
 28 |       int oldpixel = constrain((_input_for_dither.pixels[x+y*_input_for_dither.width] >> 16 & 0xFF)+int(255.0*(1-_input_value)-127.0),0,255);
 29 |       int newpixel  = 255*round((oldpixel)/(255.0));
 30 |       _input_for_dither.pixels[x+y*_input_for_dither.width] = color(newpixel);
 31 |       int quant_error  = oldpixel - newpixel;
 32 |       float color_1 = (((_input_for_dither.pixels[(x+1)+(y+0)*_input_for_dither.width]>> 16 & 0xFF) + quant_error * 7/ 16));
 33 |       float color_2 = (((_input_for_dither.pixels[(x-1)+(y+1)*_input_for_dither.width]>> 16 & 0xFF) + quant_error * 3/ 16));
 34 |       float color_3 = (((_input_for_dither.pixels[(x+0)+(y+1)*_input_for_dither.width]>> 16 & 0xFF) + quant_error * 5/ 16));
 35 |       float color_4 = (((_input_for_dither.pixels[(x+1)+(y+1)*_input_for_dither.width]>> 16 & 0xFF) + quant_error * 1 / 16));
 36 |       _input_for_dither.pixels[(x+1)+(y+0)*_input_for_dither.width] = color(color_1);
 37 |       _input_for_dither.pixels[(x-1)+(y+1)*_input_for_dither.width] = color(color_2);
 38 |       _input_for_dither.pixels[(x+0)+(y+1)*_input_for_dither.width] = color(color_3);
 39 |       _input_for_dither.pixels[(x+1)+(y+1)*_input_for_dither.width] = color(color_4);
 40 |     }
 41 |   }
 42 |   _input_for_dither.updatePixels();
 43 |   return(_input_for_dither);
 44 | }
 45 | 
 46 | PImage run_threshold(PImage _source_image, PImage _input_image, float _input_value) {
 47 |   float temp_brightness=0;
 48 |   _input_image.loadPixels();
 49 |   for (int i = 0; i < _source_image.width*_source_image.height; i++) {
 50 |     temp_brightness = (_source_image.pixels[i] >> 16 & 0xFF);
 51 |     if (temp_brightness>_input_value) {
 52 |       _input_image.pixels[i] = color(255);
 53 |     } else {
 54 |       _input_image.pixels[i] = color(0);
 55 |     }
 56 |   }
 57 |   _input_image.updatePixels();
 58 |   return(_input_image);
 59 | }
 60 | 
 61 | void compose_BRD_layers() {
 62 | 
 63 | 
 64 | 
 65 | 
 66 | 
 67 |   BRD_layer_images[1].loadPixels(); //composing tStop
 68 |   for (int i = 0; i < BRD_layer_images[1].width*BRD_layer_images[1].height; i++) {
 69 |     BRD_layer_images[1].pixels[i] =
 70 |       (~((~brightness_layer_images[1].pixels[i])
 71 |       |(brightness_layer_images[2].pixels[i])
 72 |       |(brightness_layer_images[3].pixels[i])
 73 |       |(brightness_layer_images[4].pixels[i])
 74 |       |(brightness_layer_images[5].pixels[i])
 75 |       |(brightness_layer_images[6].pixels[i])))
 76 |       &((~brightness_layer_images[0].pixels[i])
 77 |       |(~brightness_layer_images[7].pixels[i]));
 78 |   }
 79 |   BRD_layer_images[1].updatePixels(); 
 80 | 
 81 | 
 82 | 
 83 |   BRD_layer_images[0].loadPixels();  //composing bStop
 84 |   for (int i = 0; i < BRD_layer_images[0].width*BRD_layer_images[0].height; i++) {
 85 |     BRD_layer_images[0].pixels[i] =
 86 |       (~((brightness_layer_images[3].pixels[i])
 87 |       |(brightness_layer_images[4].pixels[i])
 88 |       |(brightness_layer_images[5].pixels[i])))
 89 |       &((~brightness_layer_images[0].pixels[i])
 90 |       |(~brightness_layer_images[1].pixels[i]));
 91 |   }
 92 |   BRD_layer_images[0].updatePixels(); 
 93 | 
 94 |   BRD_layer_images[2].loadPixels(); //composing TOP
 95 |   for (int i = 0; i < BRD_layer_images[2].width*BRD_layer_images[2].height; i++) {
 96 |     BRD_layer_images[2].pixels[i] =
 97 |       ~(~((~brightness_layer_images[0].pixels[i])
 98 |       |(~brightness_layer_images[1].pixels[i])
 99 |       |(brightness_layer_images[3].pixels[i])
100 |       |(brightness_layer_images[4].pixels[i])
101 |       |(brightness_layer_images[5].pixels[i])
102 |       |(brightness_layer_images[6].pixels[i])))
103 |       &((brightness_layer_images[2].pixels[i])
104 |       |(~brightness_layer_images[7].pixels[i]));
105 |   }
106 |   BRD_layer_images[2].updatePixels(); 
107 | 
108 | 
109 |   BRD_layer_images[3].loadPixels(); //composing BOTTOM
110 |   for (int i = 0; i < BRD_layer_images[3].width*BRD_layer_images[3].height; i++) {
111 |     BRD_layer_images[3].pixels[i] =
112 |       ~(~((~brightness_layer_images[0].pixels[i])
113 |       |(~brightness_layer_images[1].pixels[i])
114 |       |(brightness_layer_images[3].pixels[i])
115 |       |(brightness_layer_images[4].pixels[i])))
116 |       &(brightness_layer_images[5].pixels[i]);
117 |   }
118 |   BRD_layer_images[3].updatePixels(); 
119 | 
120 |   BRD_layer_images[4].loadPixels(); //composing tPlace
121 |   for (int i = 0; i < BRD_layer_images[4].width*BRD_layer_images[4].height; i++) {
122 |     BRD_layer_images[4].pixels[i] =
123 |       ~(~((~brightness_layer_images[0].pixels[i])
124 |       |(~brightness_layer_images[1].pixels[i])
125 |       |(brightness_layer_images[2].pixels[i])
126 |       |(brightness_layer_images[3].pixels[i])
127 |       |(brightness_layer_images[4].pixels[i])
128 |       |(brightness_layer_images[5].pixels[i])
129 |       |(~brightness_layer_images[7].pixels[i])))
130 |       &(brightness_layer_images[6].pixels[i]);
131 |   }
132 |   BRD_layer_images[4].updatePixels(); 
133 | 
134 |   BRD_layer_images[5].loadPixels(); //composing bPlace
135 |   for (int i = 0; i < BRD_layer_images[5].width*BRD_layer_images[5].height; i++) {
136 |     BRD_layer_images[5].pixels[i] =
137 |       ~(~((~brightness_layer_images[0].pixels[i])
138 |       |(~brightness_layer_images[1].pixels[i])
139 |       |(brightness_layer_images[3].pixels[i])
140 |       |(brightness_layer_images[5].pixels[i])))
141 |       &(brightness_layer_images[4].pixels[i]);
142 |   }
143 |   BRD_layer_images[5].updatePixels();
144 | }
145 | 
146 | void compose_preview() {
147 |   output_preview_image.loadPixels(); //composing preview
148 |   float temp_red = 0;
149 |   float temp_green = 0;
150 |   float temp_blue = 0;
151 |   for (int i = 0; i < output_preview_image.width*output_preview_image.height; i++) {
152 |     temp_red+=(255-(BRD_layer_images[0].pixels[i] & 0xFF))*0.2;
153 |     temp_red+=(255-(BRD_layer_images[1].pixels[i] & 0xFF))*0.2;
154 |     temp_red+=(BRD_layer_images[2].pixels[i] & 0xFF)*0.2;
155 |     temp_red+=(BRD_layer_images[3].pixels[i] & 0xFF)*0.2;
156 |     temp_red/=4;
157 |     temp_green+=(255-(BRD_layer_images[0].pixels[i] & 0xFF))*0.5;
158 |     temp_green+=(255-(BRD_layer_images[1].pixels[i] & 0xFF))*0.5;
159 |     temp_green+=(BRD_layer_images[2].pixels[i] & 0xFF)*0.5;
160 |     temp_green+=(BRD_layer_images[3].pixels[i] & 0xFF)*0.5;
161 |     temp_green/=4;
162 |     temp_blue+=(255-(BRD_layer_images[0].pixels[i] & 0xFF))*0.1;
163 |     temp_blue+=(255-(BRD_layer_images[1].pixels[i] & 0xFF))*0.1;
164 |     temp_blue+=(BRD_layer_images[2].pixels[i] & 0xFF)*0.1;
165 |     temp_blue+=(BRD_layer_images[3].pixels[i] & 0xFF)*0.1;
166 |     temp_blue/=4;
167 |     output_preview_image.pixels[i] = color(temp_red, temp_green, temp_blue);
168 |   }
169 |   output_preview_image.updatePixels();
170 | }


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 |                     GNU GENERAL PUBLIC LICENSE
  2 |                        Version 3, 29 June 2007
  3 | 
  4 |  Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  5 |  Everyone is permitted to copy and distribute verbatim copies
  6 |  of this license document, but changing it is not allowed.
  7 | 
  8 |                             Preamble
  9 | 
 10 |   The GNU General Public License is a free, copyleft license for
 11 | software and other kinds of works.
 12 | 
 13 |   The licenses for most software and other practical works are designed
 14 | to take away your freedom to share and change the works.  By contrast,
 15 | the GNU General Public License is intended to guarantee your freedom to
 16 | share and change all versions of a program--to make sure it remains free
 17 | software for all its users.  We, the Free Software Foundation, use the
 18 | GNU General Public License for most of our software; it applies also to
 19 | any other work released this way by its authors.  You can apply it to
 20 | your programs, too.
 21 | 
 22 |   When we speak of free software, we are referring to freedom, not
 23 | price.  Our General Public Licenses are designed to make sure that you
 24 | have the freedom to distribute copies of free software (and charge for
 25 | them if you wish), that you receive source code or can get it if you
 26 | want it, that you can change the software or use pieces of it in new
 27 | free programs, and that you know you can do these things.
 28 | 
 29 |   To protect your rights, we need to prevent others from denying you
 30 | these rights or asking you to surrender the rights.  Therefore, you have
 31 | certain responsibilities if you distribute copies of the software, or if
 32 | you modify it: responsibilities to respect the freedom of others.
 33 | 
 34 |   For example, if you distribute copies of such a program, whether
 35 | gratis or for a fee, you must pass on to the recipients the same
 36 | freedoms that you received.  You must make sure that they, too, receive
 37 | or can get the source code.  And you must show them these terms so they
 38 | know their rights.
 39 | 
 40 |   Developers that use the GNU GPL protect your rights with two steps:
 41 | (1) assert copyright on the software, and (2) offer you this License
 42 | giving you legal permission to copy, distribute and/or modify it.
 43 | 
 44 |   For the developers' and authors' protection, the GPL clearly explains
 45 | that there is no warranty for this free software.  For both users' and
 46 | authors' sake, the GPL requires that modified versions be marked as
 47 | changed, so that their problems will not be attributed erroneously to
 48 | authors of previous versions.
 49 | 
 50 |   Some devices are designed to deny users access to install or run
 51 | modified versions of the software inside them, although the manufacturer
 52 | can do so.  This is fundamentally incompatible with the aim of
 53 | protecting users' freedom to change the software.  The systematic
 54 | pattern of such abuse occurs in the area of products for individuals to
 55 | use, which is precisely where it is most unacceptable.  Therefore, we
 56 | have designed this version of the GPL to prohibit the practice for those
 57 | products.  If such problems arise substantially in other domains, we
 58 | stand ready to extend this provision to those domains in future versions
 59 | of the GPL, as needed to protect the freedom of users.
 60 | 
 61 |   Finally, every program is threatened constantly by software patents.
 62 | States should not allow patents to restrict development and use of
 63 | software on general-purpose computers, but in those that do, we wish to
 64 | avoid the special danger that patents applied to a free program could
 65 | make it effectively proprietary.  To prevent this, the GPL assures that
 66 | patents cannot be used to render the program non-free.
 67 | 
 68 |   The precise terms and conditions for copying, distribution and
 69 | modification follow.
 70 | 
 71 |                        TERMS AND CONDITIONS
 72 | 
 73 |   0. Definitions.
 74 | 
 75 |   "This License" refers to version 3 of the GNU General Public License.
 76 | 
 77 |   "Copyright" also means copyright-like laws that apply to other kinds of
 78 | works, such as semiconductor masks.
 79 | 
 80 |   "The Program" refers to any copyrightable work licensed under this
 81 | License.  Each licensee is addressed as "you".  "Licensees" and
 82 | "recipients" may be individuals or organizations.
 83 | 
 84 |   To "modify" a work means to copy from or adapt all or part of the work
 85 | in a fashion requiring copyright permission, other than the making of an
 86 | exact copy.  The resulting work is called a "modified version" of the
 87 | earlier work or a work "based on" the earlier work.
 88 | 
 89 |   A "covered work" means either the unmodified Program or a work based
 90 | on the Program.
 91 | 
 92 |   To "propagate" a work means to do anything with it that, without
 93 | permission, would make you directly or secondarily liable for
 94 | infringement under applicable copyright law, except executing it on a
 95 | computer or modifying a private copy.  Propagation includes copying,
 96 | distribution (with or without modification), making available to the
 97 | public, and in some countries other activities as well.
 98 | 
 99 |   To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies.  Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 | 
103 |   An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License.  If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 | 
112 |   1. Source Code.
113 | 
114 |   The "source code" for a work means the preferred form of the work
115 | for making modifications to it.  "Object code" means any non-source
116 | form of a work.
117 | 
118 |   A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 | 
123 |   The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form.  A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 | 
134 |   The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities.  However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work.  For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 | 
147 |   The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 | 
151 |   The Corresponding Source for a work in source code form is that
152 | same work.
153 | 
154 |   2. Basic Permissions.
155 | 
156 |   All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met.  This License explicitly affirms your unlimited
159 | permission to run the unmodified Program.  The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work.  This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 | 
164 |   You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force.  You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright.  Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 | 
175 |   Conveying under any other circumstances is permitted solely under
176 | the conditions stated below.  Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 | 
179 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 | 
181 |   No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 | 
187 |   When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 | 
195 |   4. Conveying Verbatim Copies.
196 | 
197 |   You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 | 
205 |   You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 | 
208 |   5. Conveying Modified Source Versions.
209 | 
210 |   You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 | 
214 |     a) The work must carry prominent notices stating that you modified
215 |     it, and giving a relevant date.
216 | 
217 |     b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | 
222 |     c) You must license the entire work, as a whole, under this
223 |     License to anyone who comes into possession of a copy.  This
224 |     License will therefore apply, along with any applicable section 7
225 |     additional terms, to the whole of the work, and all its parts,
226 |     regardless of how they are packaged.  This License gives no
227 |     permission to license the work in any other way, but it does not
228 |     invalidate such permission if you have separately received it.
229 | 
230 |     d) If the work has interactive user interfaces, each must display
231 |     Appropriate Legal Notices; however, if the Program has interactive
232 |     interfaces that do not display Appropriate Legal Notices, your
233 |     work need not make them do so.
234 | 
235 |   A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit.  Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 | 
245 |   6. Conveying Non-Source Forms.
246 | 
247 |   You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 | 
252 |     a) Convey the object code in, or embodied in, a physical product
253 |     (including a physical distribution medium), accompanied by the
254 |     Corresponding Source fixed on a durable physical medium
255 |     customarily used for software interchange.
256 | 
257 |     b) Convey the object code in, or embodied in, a physical product
258 |     (including a physical distribution medium), accompanied by a
259 |     written offer, valid for at least three years and valid for as
260 |     long as you offer spare parts or customer support for that product
261 |     model, to give anyone who possesses the object code either (1) a
262 |     copy of the Corresponding Source for all the software in the
263 |     product that is covered by this License, on a durable physical
264 |     medium customarily used for software interchange, for a price no
265 |     more than your reasonable cost of physically performing this
266 |     conveying of source, or (2) access to copy the
267 |     Corresponding Source from a network server at no charge.
268 | 
269 |     c) Convey individual copies of the object code with a copy of the
270 |     written offer to provide the Corresponding Source.  This
271 |     alternative is allowed only occasionally and noncommercially, and
272 |     only if you received the object code with such an offer, in accord
273 |     with subsection 6b.
274 | 
275 |     d) Convey the object code by offering access from a designated
276 |     place (gratis or for a charge), and offer equivalent access to the
277 |     Corresponding Source in the same way through the same place at no
278 |     further charge.  You need not require recipients to copy the
279 |     Corresponding Source along with the object code.  If the place to
280 |     copy the object code is a network server, the Corresponding Source
281 |     may be on a different server (operated by you or a third party)
282 |     that supports equivalent copying facilities, provided you maintain
283 |     clear directions next to the object code saying where to find the
284 |     Corresponding Source.  Regardless of what server hosts the
285 |     Corresponding Source, you remain obligated to ensure that it is
286 |     available for as long as needed to satisfy these requirements.
287 | 
288 |     e) Convey the object code using peer-to-peer transmission, provided
289 |     you inform other peers where the object code and Corresponding
290 |     Source of the work are being offered to the general public at no
291 |     charge under subsection 6d.
292 | 
293 |   A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 | 
297 |   A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling.  In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage.  For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product.  A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 | 
310 |   "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source.  The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 | 
318 |   If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information.  But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 | 
329 |   The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed.  Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 | 
337 |   Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 | 
343 |   7. Additional Terms.
344 | 
345 |   "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law.  If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 | 
354 |   When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it.  (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.)  You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 | 
361 |   Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 | 
365 |     a) Disclaiming warranty or limiting liability differently from the
366 |     terms of sections 15 and 16 of this License; or
367 | 
368 |     b) Requiring preservation of specified reasonable legal notices or
369 |     author attributions in that material or in the Appropriate Legal
370 |     Notices displayed by works containing it; or
371 | 
372 |     c) Prohibiting misrepresentation of the origin of that material, or
373 |     requiring that modified versions of such material be marked in
374 |     reasonable ways as different from the original version; or
375 | 
376 |     d) Limiting the use for publicity purposes of names of licensors or
377 |     authors of the material; or
378 | 
379 |     e) Declining to grant rights under trademark law for use of some
380 |     trade names, trademarks, or service marks; or
381 | 
382 |     f) Requiring indemnification of licensors and authors of that
383 |     material by anyone who conveys the material (or modified versions of
384 |     it) with contractual assumptions of liability to the recipient, for
385 |     any liability that these contractual assumptions directly impose on
386 |     those licensors and authors.
387 | 
388 |   All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10.  If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term.  If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 | 
398 |   If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 | 
403 |   Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 | 
407 |   8. Termination.
408 | 
409 |   You may not propagate or modify a covered work except as expressly
410 | provided under this License.  Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 | 
415 |   However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 | 
422 |   Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 | 
429 |   Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License.  If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 | 
435 |   9. Acceptance Not Required for Having Copies.
436 | 
437 |   You are not required to accept this License in order to receive or
438 | run a copy of the Program.  Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance.  However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work.  These actions infringe copyright if you do
443 | not accept this License.  Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 | 
446 |   10. Automatic Licensing of Downstream Recipients.
447 | 
448 |   Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License.  You are not responsible
451 | for enforcing compliance by third parties with this License.
452 | 
453 |   An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations.  If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 | 
463 |   You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License.  For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 | 
471 |   11. Patents.
472 | 
473 |   A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based.  The
475 | work thus licensed is called the contributor's "contributor version".
476 | 
477 |   A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version.  For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 | 
487 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 | 
492 |   In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement).  To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 | 
499 |   If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients.  "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 | 
513 |   If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 | 
521 |   A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License.  You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 | 
536 |   Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 | 
540 |   12. No Surrender of Others' Freedom.
541 | 
542 |   If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License.  If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all.  For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 | 
552 |   13. Use with the GNU Affero General Public License.
553 | 
554 |   Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work.  The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 | 
563 |   14. Revised Versions of this License.
564 | 
565 |   The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time.  Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 | 
570 |   Each version is given a distinguishing version number.  If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation.  If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 | 
579 |   If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 | 
584 |   Later license versions may give you additional or different
585 | permissions.  However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 | 
589 |   15. Disclaimer of Warranty.
590 | 
591 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 | 
600 |   16. Limitation of Liability.
601 | 
602 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 | 
612 |   17. Interpretation of Sections 15 and 16.
613 | 
614 |   If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 | 
621 |                      END OF TERMS AND CONDITIONS
622 | 
623 |             How to Apply These Terms to Your New Programs
624 | 
625 |   If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 | 
629 |   To do so, attach the following notices to the program.  It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 | 
634 |     {one line to give the program's name and a brief idea of what it does.}
635 |     Copyright (C) {year}  {name of author}
636 | 
637 |     This program is free software: you can redistribute it and/or modify
638 |     it under the terms of the GNU General Public License as published by
639 |     the Free Software Foundation, either version 3 of the License, or
640 |     (at your option) any later version.
641 | 
642 |     This program is distributed in the hope that it will be useful,
643 |     but WITHOUT ANY WARRANTY; without even the implied warranty of
644 |     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
645 |     GNU General Public License for more details.
646 | 
647 |     You should have received a copy of the GNU General Public License
648 |     along with this program.  If not, see <http://www.gnu.org/licenses/>.
649 | 
650 | Also add information on how to contact you by electronic and paper mail.
651 | 
652 |   If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 | 
655 |     {project}  Copyright (C) {year}  {fullname}
656 |     This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 |     This is free software, and you are welcome to redistribute it
658 |     under certain conditions; type `show c' for details.
659 | 
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License.  Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 | 
664 |   You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | <http://www.gnu.org/licenses/>.
668 | 
669 |   The GNU General Public License does not permit incorporating your program
670 | into proprietary programs.  If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library.  If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License.  But first, please read
674 | <http://www.gnu.org/philosophy/why-not-lgpl.html>.
675 | 


--------------------------------------------------------------------------------
/Quad_Tree.pde:
--------------------------------------------------------------------------------
  1 | void create_quadtree_from_BRD_layers() {
  2 |   //if states are set
  3 |   if (BRD_layer_images!=null) {
  4 |     for (int i=0; i<BRD_layer_images.length; i++) {
  5 |       if (BRD_layer_images[i]!=null) {  //then for each brd_layer
  6 |         full_pixel_count = BRD_layer_images[i].width*BRD_layer_images[i].height;
  7 |         qt_count = 1;
  8 |         BRD_layer_images[i].loadPixels();
  9 |         Quad_Class_Thread outer_thread;
 10 |         outer_thread = new Quad_Class_Thread(number_of_iterations, 0, 0, BRD_layer_images[i].width, BRD_layer_images[i].height, 255, i);
 11 |         outer_thread.run();
 12 |         BRD_layer_images[i].updatePixels();
 13 |       }
 14 |     }
 15 |   }
 16 | }
 17 | 
 18 | 
 19 | public class Quad_Class_Thread extends Thread {
 20 |   boolean finished;
 21 |   int current_iteration;
 22 |   float x, y, w, h;
 23 |   int my_color;
 24 |   boolean waiting;
 25 |   Quad_Class_Thread[] quad_thread_array;
 26 |   int BRD_id;
 27 | 
 28 |   Quad_Class_Thread( int _current_iteration, float _x, float _y, float _w, float _h, int _c, int _BRD_id) {
 29 |     finished = true;
 30 |     waiting=false;
 31 |     current_iteration = _current_iteration;
 32 |     x=_x;
 33 |     y=_y;
 34 |     w=_w;
 35 |     h=_h;
 36 |     my_color = _c;
 37 |     BRD_id=_BRD_id;
 38 |   } 
 39 | 
 40 |   public void run() {
 41 | 
 42 |     /*
 43 |        does this pass a uniformity check?
 44 |      
 45 |      yes -> what color am I? draw me!
 46 |      
 47 |      no  -> am I the last iteration?
 48 |      
 49 |      if so, draw me as black
 50 |      
 51 |      if not split me
 52 |      
 53 |      
 54 |      */
 55 |     if (w>0) {
 56 |       if (check_uniform()) {
 57 |         if ((( BRD_layer_images[BRD_id].get(int(x), int(y)))>> 16 & 0xFF)==0) {
 58 |           rect_array[BRD_id] = (Rect_Class[]) append(rect_array[BRD_id], new Rect_Class(x, y, w, h, color(w, current_iteration*15, 60)));
 59 |         }
 60 |       } else { // is non uniform
 61 |         if (current_iteration==0) {
 62 |           rect_array[BRD_id] = (Rect_Class[]) append(rect_array[BRD_id], new Rect_Class(x, y, w, h, color(w, current_iteration*15, 60)));
 63 |         } else { // non last iteration and non uniform
 64 |           split_quad();
 65 |         }
 66 |       }
 67 |     }
 68 |   }
 69 | 
 70 | 
 71 |   boolean check_uniform() {
 72 |     int first_pixel= ( BRD_layer_images[BRD_id].get(int(x), int(y)))>> 16 & 0xFF;
 73 |     for (int y_index=0; y_index<h; y_index++) {
 74 |       for (int x_index=0; x_index<w; x_index++) {
 75 |         //int i_index = (x_index+y_index*w)+x+y+y_index*abs(test_image_1.width-w);
 76 |         //int current_pixel = (test_image_1.pixels[i_index]) >> 16 & 0xFF;
 77 |         int current_pixel =  ( BRD_layer_images[BRD_id].get(int(x+x_index), int(y+y_index)))>> 16 & 0xFF;
 78 |         if (current_pixel!=first_pixel) {
 79 |           return false;
 80 |         }
 81 |       }
 82 |     }
 83 |     return true;
 84 |   }
 85 | 
 86 | 
 87 | 
 88 | 
 89 |   void split_quad() {
 90 |     quad_thread_array = new Quad_Class_Thread[4];
 91 |     for (int i=0; i<4; i++) {
 92 |       //println("I'm splitting to quad "+i);
 93 |       quad_thread_array[i] = new Quad_Class_Thread((current_iteration-1), (x+(w*0.5)*(i%2)), (y+(h/2)*floor(i*0.5)), (w*0.5), (h*0.5), color(i*255.0*0.25), BRD_id);
 94 |       quad_thread_array[i].run();
 95 |     } 
 96 |     waiting = true;
 97 |     while (waiting) { //wait for children to finish!
 98 |       if ((quad_thread_array[0].finished==true)
 99 |         &&(quad_thread_array[1].finished==true)
100 |         &&(quad_thread_array[2].finished==true)
101 |         &&(quad_thread_array[3].finished==true)) {
102 |         waiting=false;
103 |       }
104 |     }
105 |   }
106 | }


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # PCBArt_Eagle
 2 | Version 0.2.4
 3 | Last edited: 20/11/16.
 4 | Created by: Alon Gruss.
 5 | 
 6 | Converts an image into a 2-layerd PCB Eagle .brd file
 7 |  The app works in following manner:
 8 |  image > threshold layers > [BITWISE COMPOSE BRD LAYERS] > quadtree > export to xml polygons
 9 |  (while giving back visual feedback)
10 | 
11 | Working features:
12 | * formated and refactored code.
13 | * 6 layers hardcoded.
14 | * loads image files.
15 | * check for image file validity in format, filesize, number of pixels.
16 | * copy to layers.
17 | * runs a threshold filter on each layer.
18 | * creates a quadtree for each layer.
19 | * quadtree function is thread based.
20 | * realtime GUI sliders using the G4P library.
21 | * preview of layers and expected result.
22 | * exports an Eagle .brd file (xml).
23 | * Dithering! (Floyd–Steinberg dithering)
24 | 
25 | 
26 | TODO:
27 | 
28 | * progress bar.
29 | * import existing .brd file.
30 | * option for SVG vector files using the Geomartive library.
31 | * logs functions to log file.
32 | * exports image files of the layers and the final preview.
33 | 


--------------------------------------------------------------------------------
/Rect_Class.pde:
--------------------------------------------------------------------------------
 1 | 
 2 | class Rect_Class {
 3 |   float x, y, w, h; 
 4 |   color c;
 5 |   Rect_Class(float _x, float _y, float _w, float _h, color _c) {
 6 |     x=(_x);
 7 |     y=(_y);
 8 |     w=(_w);
 9 |     h=(_h);
10 |     c=_c;
11 |   }
12 | 
13 |   void display() {
14 |     pushMatrix();
15 |     translate(x, y);
16 |     pushStyle();
17 |     noStroke();
18 |     strokeWeight(0.5);
19 |     stroke(255, 0, 0, 20);
20 |     fill(c, 100);
21 |     rect(0, 0, w, h);
22 |     popStyle();
23 |     popMatrix();
24 |   }
25 | }


--------------------------------------------------------------------------------
/UI.pde:
--------------------------------------------------------------------------------
  1 | void setup_UI() {
  2 |   b_open = new GButton(this, 0, height*0.95, 100, height*0.05, "OPEN");
  3 |   b_open.setLocalColor(2, color(0)); //text color
  4 |   b_open.setLocalColor(3, color(0)); //outline color
  5 |   b_open.setLocalColor(4, color(255)); //fill color
  6 |   b_open.setLocalColor(6, color(0, 255, 0)); //hover fill color
  7 | 
  8 |   b_quadtree = new GButton(this, 100, height*0.95, 100, height*0.05, "QUAD");
  9 |   b_quadtree.setLocalColor(2, color(0)); //text color
 10 |   b_quadtree.setLocalColor(3, color(0)); //outline color
 11 |   b_quadtree.setLocalColor(4, color(255)); //fill color
 12 |   b_quadtree.setLocalColor(6, color(0, 255, 0)); //hover fill color
 13 | 
 14 |   b_export = new GButton(this, 200, height*0.95, 100, height*0.05, "EXPORT");
 15 |   b_export.setLocalColor(2, color(0)); //text color
 16 |   b_export.setLocalColor(3, color(0)); //outline color
 17 |   b_export.setLocalColor(4, color(255)); //fill color
 18 |   b_export.setLocalColor(6, color(0, 255, 0)); //hover fill color
 19 | }
 20 | 
 21 | void setup_sliders() {
 22 |   slider_array = new GCustomSlider[brightness_layer_images.length];
 23 |   for (int i=0; i<slider_array.length; i++) {
 24 |     slider_array[i]=new GCustomSlider(this, DEFAULT_IMAGE_WIDTH+(i%3)*DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, floor(i/3)*DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT, DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT, "blue18px");
 25 |     slider_array[i].setValue(float(i)/float(slider_array.length));
 26 |     slider_array[i].setEasing(10.0);
 27 |     brightness_layer_images[i]=run_threshold(resized_input_image, brightness_layer_images[i], slider_array[i].getValueF()*255.0);
 28 |     //brightness_layer_images[i]=dither(brightness_layer_images[i],slider_array[i].getValueF());
 29 |   }
 30 | }
 31 | 
 32 | public void handleButtonEvents(GButton button, GEvent event) { 
 33 |   if (button==b_open) {
 34 |     File default_folder = new File( sketchPath("")+"/ ");
 35 |     selectInput("Select a file to process:", "fileSelected", default_folder);
 36 |   }
 37 | 
 38 |   if (button==b_quadtree) {
 39 |     loading=true;
 40 |     create_quadtree_from_BRD_layers();
 41 |   }
 42 | 
 43 |   if (button==b_export) {
 44 |     export_BRD();
 45 |   }
 46 | }
 47 | 
 48 | public void handleSliderEvents(GValueControl slider, GEvent event) { 
 49 |   for (int i=0; i<slider_array.length; i++) {
 50 |     if (slider == slider_array[i]) {
 51 |       //brightness_layer_images[i]=dither(brightness_layer_images[i],slider_array[i].getValueF());
 52 |       brightness_layer_images[i]=run_threshold(resized_input_image, brightness_layer_images[i], slider_array[i].getValueF()*255.0);
 53 |     }
 54 |   }
 55 |   compose_BRD_layers();
 56 |   compose_preview();
 57 | }
 58 | 
 59 | void fileSelected(File selection) {
 60 |   if (selection != null) {
 61 |     image_loaded = false;
 62 |     String filename = selection.getName();
 63 |     filename = filename.toLowerCase();
 64 |     int index_of_extension = filename.lastIndexOf('.');
 65 |     if (index_of_extension > 0) {
 66 |       String extension = filename.substring(index_of_extension+1);
 67 |       if (extension.equals("jpg")||extension.equals("png")||extension.equals("bmp")) {
 68 |         status_msg = "File is a valid image type: " +extension; 
 69 |         input_image = loadImage(selection.getAbsolutePath()); 
 70 |         if ((input_image==null)||(input_image.width<=0)||(input_image.height<=0)) {
 71 |           status_msg = "Bad or corrupted file data!";
 72 |         } else if ((input_image.width>10000)||(input_image.height>10000)) {
 73 |           status_msg = "Image dimensions too big";
 74 |         } else {
 75 |           image_loaded = true;
 76 |           copy_input_image_to_resized();
 77 |           copy_resized_image_to_brightness_layers();
 78 |           init_BRD_layers();
 79 |           init_output_preview();
 80 |           setup_sliders();
 81 |           status_msg = "Image loaded!";
 82 |         }
 83 |       } else {
 84 |         status_msg = "File is NOT a valid image type! (" +extension+ ")";
 85 |       }
 86 |     }
 87 |   } else {
 88 |     status_msg = "Wrong filename or filetype";
 89 |   }
 90 | }
 91 | 
 92 | void draw_status_bar(float _x, float _y, float _w, float _h) {
 93 |   pushStyle();
 94 |   stroke(0);
 95 |   fill(255);
 96 |   rect (_x, _y, _w, _h);
 97 |   fill(0);
 98 |   textSize(10);
 99 |   int status_text_gap = 20;
100 |   textAlign(LEFT, CENTER);
101 |   text("STATUS: "+status_msg, _x+status_text_gap, _y, _w-status_text_gap*2, _h);
102 |   popStyle();
103 | }
104 | 
105 | void draw_loading_bar(float _x, float _y, float _w, float _h) {
106 |   pushStyle();
107 |   stroke(0);
108 |   fill(255);
109 |   rect (_x, _y, _w, _h);
110 |   if (loading) {
111 |     loading_percent= qt_count/full_pixel_count;
112 |     if (loading_percent==100)
113 |     {
114 |       loading=false;
115 |     }
116 |     fill(255-loading_percent*255, loading_percent*255, 0);
117 |     rect (_x+2, _y+2, loading_percent*(_w-4), _h-4);
118 |     textSize(10);
119 |     int status_text_gap = 20;
120 |     textAlign(LEFT, CENTER);
121 |     fill(0);
122 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap, _y+1, _w-status_text_gap*2, _h);
123 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap, _y-1, _w-status_text_gap*2, _h);
124 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap-1, _y, _w-status_text_gap*2, _h);
125 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap+1, _y, _w-status_text_gap*2, _h);
126 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap+1, _y+1, _w-status_text_gap*2, _h);
127 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap-1, _y-1, _w-status_text_gap*2, _h);
128 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap-1, _y+1, _w-status_text_gap*2, _h);
129 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap+1, _y-1, _w-status_text_gap*2, _h);
130 |     fill(255);
131 |     text("WORK IN PROGRESS // "+int(loading_percent*100.0)+"%", _x+status_text_gap, _y, _w-status_text_gap*2, _h);
132 |   } else {
133 |     fill(0);
134 |     textSize(10);
135 |     int status_text_gap = 20;
136 |     textAlign(LEFT, CENTER);
137 |     text("NO TASKS", _x+status_text_gap, _y, _w-status_text_gap*2, _h);
138 |   }
139 |   popStyle();
140 | }


--------------------------------------------------------------------------------
/binaries/DISCLAIMER:
--------------------------------------------------------------------------------
1 | Use at own risk.
2 | 


--------------------------------------------------------------------------------
/binaries/application.windows32.rar:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/alongruss/PCBArt_Eagle/8a38d0fd2b20778f4dbdad80e26ce35b82463d19/binaries/application.windows32.rar


--------------------------------------------------------------------------------
/binaries/application.windows64.rar:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/alongruss/PCBArt_Eagle/8a38d0fd2b20778f4dbdad80e26ce35b82463d19/binaries/application.windows64.rar


--------------------------------------------------------------------------------
/data/0.txt:
--------------------------------------------------------------------------------
1 | 
2 | 


--------------------------------------------------------------------------------
/data/6fvwkqsr.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/alongruss/PCBArt_Eagle/8a38d0fd2b20778f4dbdad80e26ce35b82463d19/data/6fvwkqsr.jpg


--------------------------------------------------------------------------------
/data/alongruss.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/alongruss/PCBArt_Eagle/8a38d0fd2b20778f4dbdad80e26ce35b82463d19/data/alongruss.jpg


--------------------------------------------------------------------------------
/data/arial.ttf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/alongruss/PCBArt_Eagle/8a38d0fd2b20778f4dbdad80e26ce35b82463d19/data/arial.ttf


--------------------------------------------------------------------------------
/pcb_design_020.pde:
--------------------------------------------------------------------------------
  1 | /*
  2 | PCBArt
  3 |  ------
  4 |  
  5 |  ver 0.2.5
  6 |  Program by: Alon Gruss.
  7 |  Last Edited in: 21/11/16.
  8 |  
  9 |  The app works in following manner:
 10 |  image > brightness layers > [BITWISE COMPOSE BRD LAYERS] > export to xml polygons
 11 |  (while constantly giving back visual feedback)
 12 |  
 13 |  
 14 |  ///////////////////////safe-zone-start/////////////////////////////
 15 | /*
 16 |  UI
 17 |  --------------
 18 |  */
 19 | import g4p_controls.*;
 20 | GButton b_open;
 21 | GButton b_quadtree;
 22 | GButton b_export;
 23 | GCustomSlider[] slider_array;
 24 | String status_msg = "";
 25 | boolean loading=false;
 26 | float loading_percent = 0.5;
 27 | 
 28 | /*
 29 |   DEBUG CONTROLS
 30 |  --------------
 31 |  */
 32 | boolean DEBUG_NO_IMAGE_MODE = true;
 33 | 
 34 | /*
 35 |   DEFAULTS
 36 |  --------------
 37 |  */
 38 | 
 39 | int DEFAULT_IMAGE_WIDTH = 500;
 40 | int DEFAULT_IMAGE_HEIGHT = 500;
 41 | int DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH = 167;
 42 | int DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT = 167;
 43 | int DEFAULT_IMAGE_BRD_LAYER_PREVIEW_WIDTH = 84;
 44 | int DEFAULT_IMAGE_BRD_LAYER_PREVIEW_HEIGHT = 84;
 45 | 
 46 | int DEFAULT_WINDOW_WIDTH = 2*DEFAULT_IMAGE_WIDTH+3*DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH+DEFAULT_IMAGE_BRD_LAYER_PREVIEW_WIDTH;
 47 | int DEFAULT_WINDOW_HEIGHT = 530;
 48 | int DEFAULT_STATUS_BAR_WIDTH = DEFAULT_WINDOW_WIDTH-1;
 49 | int DEFAULT_STATUS_BAR_HEIGHT = 30;
 50 | 
 51 | /*
 52 |   IMAGES
 53 |  --------------
 54 |  */
 55 | PImage input_image;
 56 | PImage resized_input_image;
 57 | PImage[] brightness_layer_images = new PImage[8];
 58 | PImage[] BRD_layer_images = new PImage[6];
 59 | PImage output_preview_image;
 60 | 
 61 | 
 62 | /*
 63 |   IO
 64 |  --------------
 65 |  */
 66 | boolean image_loaded = false;
 67 | PrintWriter BRD_writer;
 68 | String file_location = "";
 69 | float BRD_scalar = 0.14;
 70 | 
 71 | /*
 72 |   QUADTREE
 73 |  --------------
 74 |  */
 75 | Quad_Class_Thread outer_thread;
 76 | int number_of_iterations = 7;
 77 | Rect_Class[][] rect_array;
 78 | int qt_count = 0;
 79 | int full_pixel_count = 1;
 80 | 
 81 | 
 82 | void settings() {
 83 |   size(DEFAULT_WINDOW_WIDTH, DEFAULT_WINDOW_HEIGHT);
 84 |   noSmooth();
 85 | }
 86 | 
 87 | void setup() {
 88 |   surface.setTitle("PCB as ART ver.0.2.2");
 89 |   setup_UI();
 90 |   rect_array = new Rect_Class[6][0];
 91 |   //for (int i=0;i<rect_array.length;i++){
 92 |   // rect_array[i] = new Rect_Class[0];
 93 |   //}
 94 | }
 95 | 
 96 | void draw() {
 97 | 
 98 |   //loading_percent = mouseX/float(width);
 99 |   background(200);
100 |   stroke(0);
101 |   fill(100);
102 |   if (image_loaded) {
103 |     if (resized_input_image!=null) {
104 |       image(resized_input_image, 0, 0, DEFAULT_IMAGE_WIDTH, DEFAULT_IMAGE_HEIGHT);
105 |     }
106 | 
107 |     for (int i=0; i<brightness_layer_images.length; i++) {
108 |       if (brightness_layer_images[i]!=null) {
109 |         image(brightness_layer_images[i], DEFAULT_IMAGE_WIDTH+(i%3)*DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, floor(i/3)*DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT, DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT);
110 |         noFill();
111 |         rect(DEFAULT_IMAGE_WIDTH+(i%3)*DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, floor(i/3)*DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT, DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT);
112 |       } else {
113 |         //fill(255,0,0); 
114 |         //rect(DEFAULT_IMAGE_WIDTH+(i%3)*DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, floor(i/3)*DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT, DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, DEFAULT_IMAGE_SCREEN_PREVIEW_HEIGHT);
115 |       }
116 |     }
117 | 
118 |     for (int i=0; i<BRD_layer_images.length; i++) {
119 |       if (BRD_layer_images[i]!=null) {
120 |         image(BRD_layer_images[i], DEFAULT_IMAGE_WIDTH+3*DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, i*DEFAULT_IMAGE_BRD_LAYER_PREVIEW_HEIGHT, DEFAULT_IMAGE_BRD_LAYER_PREVIEW_WIDTH, DEFAULT_IMAGE_BRD_LAYER_PREVIEW_HEIGHT);
121 |         noFill();
122 |         rect(DEFAULT_IMAGE_WIDTH+3*DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, i*DEFAULT_IMAGE_BRD_LAYER_PREVIEW_HEIGHT, DEFAULT_IMAGE_BRD_LAYER_PREVIEW_WIDTH, DEFAULT_IMAGE_BRD_LAYER_PREVIEW_HEIGHT);
123 |       } else {
124 |         //fill(255,0,0); 
125 |         //rect(DEFAULT_IMAGE_WIDTH+3*DEFAULT_IMAGE_SCREEN_PREVIEW_WIDTH, i*DEFAULT_IMAGE_BRD_LAYER_PREVIEW_HEIGHT, DEFAULT_IMAGE_BRD_LAYER_PREVIEW_WIDTH, DEFAULT_IMAGE_BRD_LAYER_PREVIEW_HEIGHT);
126 |       }
127 |     }
128 | 
129 |     //for (int i=0; i<rect_array.length; i++) {
130 |     if (rect_array[3]!=null) {
131 |       for (int j=0; j<rect_array[3].length; j++) {
132 |         rect_array[3][j].display();
133 |       }
134 |     }
135 |     //}
136 | 
137 |     if (output_preview_image!=null) {
138 |       image(output_preview_image, DEFAULT_WINDOW_WIDTH-DEFAULT_IMAGE_WIDTH, 0, DEFAULT_IMAGE_WIDTH, DEFAULT_IMAGE_HEIGHT);
139 |       noFill();
140 |       rect(DEFAULT_WINDOW_WIDTH-DEFAULT_IMAGE_WIDTH, 0, DEFAULT_IMAGE_WIDTH, DEFAULT_IMAGE_HEIGHT);
141 |     } else {
142 |       //fill(255,0,0); 
143 |       //rect(DEFAULT_WINDOW_WIDTH-DEFAULT_IMAGE_WIDTH, 0, DEFAULT_IMAGE_WIDTH, DEFAULT_IMAGE_HEIGHT);
144 |     }
145 |   }
146 |   draw_status_bar(300, DEFAULT_WINDOW_HEIGHT-DEFAULT_STATUS_BAR_HEIGHT, (DEFAULT_STATUS_BAR_WIDTH-300)*0.5, DEFAULT_STATUS_BAR_HEIGHT-1);
147 |   draw_loading_bar(300+(DEFAULT_STATUS_BAR_WIDTH-300)*0.5, DEFAULT_WINDOW_HEIGHT-DEFAULT_STATUS_BAR_HEIGHT, (DEFAULT_STATUS_BAR_WIDTH-300)*0.5, DEFAULT_STATUS_BAR_HEIGHT-1);
148 | }
149 | /////////////////////////safe-zone-finish/////////////////////////////


--------------------------------------------------------------------------------