[task #13658] Work on concave polygons too

[Sachin Kumar Singh]

Follow-up Comment #19, task #13658 (project gnuastro):

For the function to find if the polygon is convex or concave, we can simply:

sort all the points;
test all three consecutive points in the list using right-hand cross rule and
vector cross product;
  if any of the points fail then the polygon is concave; 
  else convex;

    _______________________________________________________

Reply to this item at:

  <https://savannah.gnu.org/task/?13658>

_______________________________________________
  Message sent via Savannah
  https://savannah.gnu.org/