[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[task #13658] Work on concave polygons too

From: Sachin Kumar Singh
Subject: [task #13658] Work on concave polygons too
Date: Sun, 15 Mar 2020 14:35:42 -0400 (EDT)
User-agent: Mozilla/5.0 (X11; Ubuntu; Linux x86_64; rv:73.0) Gecko/20100101 Firefox/73.0

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

I've added a new function inside the concavesort.c which uses winding number
<> to
identify points inside a non-convex polygon. 

I've also removed the global variables which really were a nuisance and
instead used pointers:-). Some minor bugs were fixed and better names are
assigned to the functions. This also fixes task #14639 to a certain extent,
only proper sanity checks and formatting for the SAO DS9 format remains.  

Points are now sorted in the anti-clockwise direction. 
Regarding the option to avoid sorting and let the program use the same order
that the user-provided, I think we can take the input as an edge list and use
a flag to indicate that the user is giving such an input. Then we can use a
different sort function to sort the edges instead of points(which will be
easier to implement using a map/tree data structure). 


Reply to this item at:


  Message sent via Savannah

reply via email to

[Prev in Thread] Current Thread [Next in Thread]