[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: Fri, 6 Mar 2020 10:12:14 -0500 (EST)
User-agent: Mozilla/5.0 (X11; Ubuntu; Linux x86_64; rv:73.0) Gecko/20100101 Firefox/73.0

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

What if the centroid lies outside the polygon? Will this method will still be
valid? If not, I think we can sort the points using polar coordinates and
their distance from a fixed point(which can be the point which is the
lowermost and rightmost, for example). But I'm not sure about the feasibility
of this method. A bit more discussion is required:-)

Also in the manual, it is stated that the problems with concave polygons *"is
because we are always going to be calculating the area of the overlap between
a quadrilateral and the pixel grid or the quadrilateral its self. "*
(page:433, polygon.h
<>). Will
sorting on this centroid based method have any effect cause we will be
calculating centroid on the basis of points
<> and not the
area <>?


Reply to this item at:


  Message sent via Savannah

reply via email to

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