❔ Getting every point in a convex hull
I have a convex hull that I create and I need to find every integer point within it.
5 Replies
The points are in the brown tiles:
I need to find a way to get every point within the brown points so I can fill it in
I haven't been able to come up with anything usable yet
not sure what's the best way to do it
but a naive approach would be to "draw" lines in between all of them
then for each row/column find the closest and the farthest line that intersects with the current row/column
line segment*
and then with that info you could just do a loop from min to max through every row/column
if you sort them first you can do way better
Was this issue resolved? If so, run
/close - otherwise I will mark this as stale and this post will be archived until there is new activity.