[task #15578] Function to find if polygon vertices are sorted anti-clockwise

[Sachin Kumar Singh]

Update of task #15578 (project gnuastro):

             Assigned to:                  sks_15 => None                   

    _______________________________________________________

Follow-up Comment #6:

I think for non-convex polygons this should do as, for example, if the figure
is intersecting this might lead to +ve value or 0 (as the case you suggested).
But still, I need to find any edge cases.

The code is rebased and pushed here
<https://github.com/sachinkumarsingh092/gnuastro/tree/task-is-sorted>.

As for the URL for the reference page, it belongs to a third party website
(element 84)(Is it okay?). I've put it in commas as it isn't possible to wrap
it in 79 columns.

    _______________________________________________________

Reply to this item at:

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

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