diff --git a/src/privatepgtypes.cpp b/src/privatepgtypes.cpp
index 953779e11167b512dc131b488c5b3780885e49f0..3d323fe693dfec012c6f7a79650cdb5921c934aa 100644
--- a/src/privatepgtypes.cpp
+++ b/src/privatepgtypes.cpp
@@ -129,7 +129,7 @@ namespace PatternGeneratorJRL
 
 
   void
-  convex_hull_t::rotate( double angle )
+  convex_hull_t::rotate(const double & angle)
   {
 
       double c_a = cos(angle);
@@ -143,7 +143,7 @@ namespace PatternGeneratorJRL
 
   }
 
-  convex_hull_s::convex_hull_s( int size )
+  convex_hull_s::convex_hull_s(const int & size)
   {
     resize(size);
     reset();
@@ -162,7 +162,7 @@ namespace PatternGeneratorJRL
   }
 
   void
-  convex_hull_t::resize( int size )
+  convex_hull_t::resize(const int & size)
     {
       X.resize(size);
       Y.resize(size);
@@ -178,20 +178,11 @@ namespace PatternGeneratorJRL
         }
     }
 
-  void
-  linear_inequality_t::clear()
+  void linear_inequality_t::clear()
   {
     x.D.clear();
     y.D.clear();
     dc.clear();
   }
 
-  void
-  linear_inequality_t::resize( int n_rows, int n_cols, bool preserve )
-  {
-    x.D.resize(n_rows, n_cols, preserve);
-    y.D.resize(n_rows, n_cols, preserve);
-    dc.resize(n_rows, preserve);
-  }
-
 }
diff --git a/src/privatepgtypes.h b/src/privatepgtypes.h
index 4f787bb76cf71fee3c4f4f39865846c5153c3942..e8f04ed2217337e7d7b6101f8660b9efec06ffd7 100644
--- a/src/privatepgtypes.h
+++ b/src/privatepgtypes.h
@@ -36,7 +36,7 @@
 namespace PatternGeneratorJRL
 {
 
-  /// \brief Support state of the robot at a certain point in time
+  // Support state of the robot at a certain point in time
   struct support_state_s
   {
     int Phase, Foot, StepsLeft, StepNumber;
@@ -51,7 +51,7 @@ namespace PatternGeneratorJRL
   };
   typedef struct support_state_s support_state_t;
 
-  /// \brief Support state of the robot at a certain point in time
+  // Support state of the robot at a certain point in time
   struct com_s
   {
     MAL_VECTOR(x,double);
@@ -114,7 +114,6 @@ namespace PatternGeneratorJRL
   };
   typedef struct reference_s reference_t;
 
-  /// \brief Solution
   struct solution_s
   {
     /// \brief Whole solution array
@@ -167,14 +166,14 @@ namespace PatternGeneratorJRL
     /// \brief Rotate the points around the origin by angle
     ///
     /// \param[in] angle
-    void rotate( double angle );
+    void rotate(const double & angle);
 
     /// \brief Resize members to the desired number of points
     ///
     /// \param[in] size
-    void resize( int size );
+    void resize(const int & size);
 
-    /// \brief Set the vectors from arrays
+    /// \brief Set the point values
     ///
     /// \param[in] X
     /// \param[in] Y
@@ -183,7 +182,7 @@ namespace PatternGeneratorJRL
     /// \brief Set all points to zero
     void reset();
 
-    convex_hull_s( int size );
+    convex_hull_s(const int & size);
     convex_hull_s();
 
   };
@@ -201,14 +200,9 @@ namespace PatternGeneratorJRL
 
     boost_ublas::vector<double> dc;
 
-    /// \brief Classifier
     int type;
 
-    /// \brief Fill all elements with zeros
     void clear();
-
-    /// \brief Resize all elements
-    void resize( int n_rows, int n_cols, bool preserve );
   };
   typedef struct linear_inequality_s
     linear_inequality_t;