3 * dyncnn is a deep-learning algorithm for the prediction of
4 * interacting object dynamics
6 * Copyright (c) 2016 Idiap Research Institute, http://www.idiap.ch/
7 * Written by Francois Fleuret <francois.fleuret@idiap.ch>
9 * This file is part of dyncnn.
11 * dyncnn is free software: you can redistribute it and/or modify it
12 * under the terms of the GNU General Public License version 3 as
13 * published by the Free Software Foundation.
15 * dyncnn is distributed in the hope that it will be useful, but
16 * WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with dyncnn. If not, see <http://www.gnu.org/licenses/>.
40 #include "canvas_cairo.h"
42 //////////////////////////////////////////////////////////////////////
44 void draw_universe_on_canvas(CanvasCairo *canvas, scalar_t scaling,
46 canvas->set_line_width(1.0 / scaling);
47 universe->draw(canvas);
50 void draw_grabbing_point_on_canvas(CanvasCairo *canvas, scalar_t scaling,
51 scalar_t xg, scalar_t yg,
52 scalar_t r, scalar_t g, scalar_t b) {
53 scalar_t radius = 1/scaling;
55 scalar_t xp[n], yp[n];
56 for(int k = 0; k < n; k++) {
57 scalar_t alpha = 2 * M_PI * scalar_t(k) / scalar_t(n);
58 xp[k] = xg + radius * cos(alpha);
59 yp[k] = yg + radius * sin(alpha);
61 canvas->set_drawing_color(r, g, b);
62 canvas->set_line_width(2.0);
63 canvas->draw_polygon(1, n, xp, yp);
66 //////////////////////////////////////////////////////////////////////
68 extern "C" void fl_generate_sequence(int nb_images,
69 int width, int height,
70 int random_shape_size, int random_colors,
71 unsigned char *output) {
73 const scalar_t world_width = width * 8;
74 const scalar_t world_height = height * 8;
75 const scalar_t scaling = 0.125;
77 const scalar_t dt = 0.1;
78 const int nb_iterations_per_steps = 5;
80 //////////////////////////////////////////////////////////////////////
82 // We will generate images { 0, every_nth, 2 * every_nth, ..., k * every_nth < nb_simulated_frames }
84 // The framerate every_nth may be set to smaller value to generate
85 // nice materials for presentations or papers.
88 int nb_simulated_frames = 1 + (nb_images - 1) * every_nth;
93 Polygon *grabbed_polygon;
95 universe = new Universe(nb_shapes, world_width, world_height);
97 const int nb_saved_frames = (nb_simulated_frames + every_nth - 1) / every_nth;
98 if(nb_saved_frames != nb_images) {
99 cerr << "It makes no sense." << endl;
103 CanvasCairo *canvases[nb_saved_frames * 2];
105 for(int s = 0; s < 2 * nb_saved_frames; s++) {
106 canvases[s] = new CanvasCairo(scaling, universe->width(), universe->height());
109 scalar_t grab_start_x, grab_start_y;
115 grab_start_x = world_width * (0.1 + 0.8 * drand48());
116 grab_start_y = world_height * (0.1 + 0.8 * drand48());
118 grab_start_x = world_width * 0.5;
119 grab_start_y = world_height * 0.75;
125 const int nb_attempts_max = 100;
128 for(int u = 0; u < nb_shapes; u++) {
135 if(random_shape_size) {
136 shape_size = 40 + 80 * drand48();
141 scalar_t red, green, blue;
148 } while(red < 0.9 and green < 0.9 and blue < 0.9 and
149 red > 0.1 and green > 0.1 and blue > 0.1);
157 scalar_t x[] = { - shape_size * 0.4, + shape_size * 0.4,
158 + shape_size * 0.4, - shape_size * 0.4 };
160 scalar_t y[] = { - shape_size * 0.6, - shape_size * 0.6,
161 + shape_size * 0.6, + shape_size * 0.6 };
163 scalar_t object_center_x = world_width * drand48();
164 scalar_t object_center_y = world_height * drand48();
167 pol = new Polygon(0.5, red, green, blue, x, y, sizeof(x) / sizeof(scalar_t));
168 pol->set_position(object_center_x, object_center_y, M_PI * 2 * drand48());
169 pol->set_speed(0, 0, 0);
171 universe->initialize_polygon(pol);
174 } while(nb_attempts < nb_attempts_max &&
175 (universe->collide(pol) || universe->collide_with_borders(pol, 2.0 / scaling)));
177 if(nb_attempts == nb_attempts_max) {
183 universe->add_polygon(pol);
187 grabbed_polygon = universe->pick_polygon(grab_start_x, grab_start_y);
188 } while(!grabbed_polygon);
192 scalar_t grab_relative_x = grabbed_polygon->relative_x(grab_start_x, grab_start_y);
193 scalar_t grab_relative_y = grabbed_polygon->relative_y(grab_start_x, grab_start_y);
195 for(int s = 0; !failed && s < nb_simulated_frames; s++) {
196 if(s % every_nth == 0) {
197 int t = s / every_nth;
198 // scalar_t xf = grabbed_polygon->absolute_x(grab_relative_x, grab_relative_y);
199 // scalar_t yf = grabbed_polygon->absolute_y(grab_relative_x, grab_relative_y);
201 // canvases[2 * t + 0]->clear();
202 // draw_grabbing_point_on_canvas(canvases[2 * t + 0], scaling,
203 // xf, yf, 0.0, 0.0, 0.0);
204 // canvases[2 * t + 1]->clear();
205 // draw_universe_on_canvas(canvases[2 * t + 1], scaling, universe);
207 canvases[t]->clear();
208 draw_universe_on_canvas(canvases[t], scaling, universe);
210 // if(show_grabbing_point) {
211 // draw_grabbing_point_on_canvas(canvases[2 * t + 1], scaling,
212 // xf, yf, 1.0, 0.0, 0.0);
216 if(s < nb_simulated_frames - 1) {
217 // Run the simulation
218 for(int i = 0; i < nb_iterations_per_steps; i++) {
219 scalar_t xf = grabbed_polygon->absolute_x(grab_relative_x, grab_relative_y);
220 scalar_t yf = grabbed_polygon->absolute_y(grab_relative_x, grab_relative_y);
221 cout << "xf = " << xf << " yf = " << yf << endl;
222 if (xf < 0 || xf >= world_width || yf < 0 || yf >= world_height) {
225 grabbed_polygon->apply_force(dt, xf, yf, 0.0, -1.0);
226 universe->update(dt, 1.0 / scaling);
231 if(failed) cout << "** FAILED" << endl;
232 else cout << "** DONE" << endl;
236 for(int t = 0; t < nb_images; t++) {
237 unsigned char *src = canvases[t]->_data;
238 unsigned char *dst = output + t * width * height * 3;
239 for(int d = 0; d < 3; d++) {
240 for(int y = 0; y < height; y++) {
241 for(int x = 0; x < width; x++) {
242 dst[x + width * (y + height * d)] = src[d + 4 * (x + width * y)];
248 for(int t = 0; t < 2 * nb_saved_frames; t++) {