uncrustify libraries/AP_Math/polygon.cpp

libraries/AP_Math/polygon.cpp

@@ -20,20 +20,20 @@
 #include "AP_Math.h"
 
 /*
-  The point in polygon algorithm is based on:
+ *  The point in polygon algorithm is based on:
-  http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html
+ *  http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html
  */
 
 
 /*
-  Polygon_outside(): test for a point in a polygon
+ *  Polygon_outside(): test for a point in a polygon
-      Input:   P = a point,
+ *     Input:   P = a point,
-               V[] = vertex points of a polygon V[n+1] with V[n]=V[0]
+ *              V[] = vertex points of a polygon V[n+1] with V[n]=V[0]
-      Return:  true if P is outside the polygon
+ *     Return:  true if P is outside the polygon
-
+ *
-  This does not take account of the curvature of the earth, but we
+ *  This does not take account of the curvature of the earth, but we
-  expect that to be very small over the distances involved in the
+ *  expect that to be very small over the distances involved in the
-  fence boundary
+ *  fence boundary
  */
 bool Polygon_outside(const Vector2l &P, const Vector2l *V, unsigned n)
 {
@@ -79,11 +79,11 @@ bool Polygon_outside(const Vector2l &P, const Vector2l *V, unsigned n)
 }
 
 /*
-  check if a polygon is complete. 
+ *  check if a polygon is complete.
-
+ *
-  We consider a polygon to be complete if we have at least 4 points,
+ *  We consider a polygon to be complete if we have at least 4 points,
-  and the first point is the same as the last point. That is the
+ *  and the first point is the same as the last point. That is the
-  minimum requirement for the Polygon_outside function to work
+ *  minimum requirement for the Polygon_outside function to work
  */
 bool Polygon_complete(const Vector2l *V, unsigned n)
 {