X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=flatland.git;a=blobdiff_plain;f=polygon.cc;h=ba629c5734bd12b7b622c3f954fe67060dda21a0;hp=69b125eb789e86e3ec798b0edbd139d1f1e5d081;hb=c1f1040936d977cd2b3a276c725e223198377d2a;hpb=26abc735ca75a78974c7ced091035e8c27ca1c00

diff --git a/polygon.cc b/polygon.cc
index 69b125e..ba629c5 100644
--- a/polygon.cc
+++ b/polygon.cc
@@ -1,26 +1,26 @@
 
 /*
- *  dyncnn is a deep-learning algorithm for the prediction of
- *  interacting object dynamics
- *
- *  Copyright (c) 2016 Idiap Research Institute, http://www.idiap.ch/
- *  Written by Francois Fleuret <francois.fleuret@idiap.ch>
- *
- *  This file is part of dyncnn.
- *
- *  dyncnn is free software: you can redistribute it and/or modify it
- *  under the terms of the GNU General Public License version 3 as
- *  published by the Free Software Foundation.
- *
- *  dyncnn is distributed in the hope that it will be useful, but
- *  WITHOUT ANY WARRANTY; without even the implied warranty of
- *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- *  General Public License for more details.
- *
- *  You should have received a copy of the GNU General Public License
- *  along with dyncnn.  If not, see <http://www.gnu.org/licenses/>.
- *
- */
+
+   flatland is a simple 2d physical simulator
+
+   Copyright (c) 2016 Idiap Research Institute, http://www.idiap.ch/
+   Written by Francois Fleuret <francois.fleuret@idiap.ch>
+
+   This file is part of flatland
+
+   flatland is free software: you can redistribute it and/or modify it
+   under the terms of the GNU General Public License version 3 as
+   published by the Free Software Foundation.
+
+   flatland is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with flatland.  If not, see <http://www.gnu.org/licenses/>.
+
+*/
 
 #include <iostream>
 
@@ -356,7 +356,9 @@ void Polygon::apply_force(scalar_t dt, scalar_t x, scalar_t y, scalar_t fx, scal
   _dtheta -= prod_vect(x - _center_x, y - _center_y, fx, fy) / (_mass * _moment_of_inertia) * dt;
 }
 
-void Polygon::apply_border_forces(scalar_t dt, scalar_t xmax, scalar_t ymax) {
+void Polygon::apply_border_forces(scalar_t dt,
+                                  scalar_t xmin, scalar_t ymin,
+                                  scalar_t xmax, scalar_t ymax) {
   for(int v = 0; v < _nb_vertices; v++) {
     int vp = (v+1)%_nb_vertices;
     for(int d = 0; d < _nb_dots[v]; d++) {
@@ -364,9 +366,9 @@ void Polygon::apply_border_forces(scalar_t dt, scalar_t xmax, scalar_t ymax) {
       scalar_t x = _x[v] * (1 - s) + _x[vp] * s;
       scalar_t y = _y[v] * (1 - s) + _y[vp] * s;
       scalar_t vx = 0, vy = 0;
-      if(x < 0) vx = x;
+      if(x < xmin) vx = xmin - x;
       else if(x > xmax) vx = x - xmax;
-      if(y < 0) vy = y;
+      if(y < ymin) vy = ymin - y;
       else if(y > ymax) vy = y - ymax;
       apply_force(dt, x, y, - dl * vx * repulsion_constant, - dl * vy * repulsion_constant);
     }
@@ -390,9 +392,10 @@ void Polygon::apply_collision_forces(scalar_t dt, int n_polygon, Polygon *p) {
       distance[d] = FLT_MAX;
     }
 
-    // First, we tag the dots located inside the polygon p
+    // First, we tag the dots located inside the polygon p by looping
+    // through the _nb_vertices - 2 triangles from the decomposition
 
-    for(int t = 0; t < p->_nb_vertices-2; t++) {
+    for(int t = 0; t < p->_nb_vertices - 2; t++) {
       scalar_t min = 0, max = 1;
       scalar_t xa = p->_x[p->_triangles[t].a], ya = p->_y[p->_triangles[t].a];
       scalar_t xb = p->_x[p->_triangles[t].b], yb = p->_y[p->_triangles[t].b];
@@ -514,6 +517,14 @@ void Polygon::apply_collision_forces(scalar_t dt, int n_polygon, Polygon *p) {
 
 }
 
+bool Polygon::collide_with_borders(scalar_t xmin, scalar_t ymin,
+                                   scalar_t xmax, scalar_t ymax) {
+  for(int n = 0; n < _nb_vertices; n++) {
+    if(_x[n] <= xmin || _x[n] >= xmax || _y[n] <= ymin || _y[n] >= ymax) return true;
+  }
+  return false;
+}
+
 bool Polygon::collide(Polygon *p) {
   for(int n = 0; n < _nb_vertices; n++) {
     int np = (n+1)%_nb_vertices;