Our strategy is to make a plan where we are sure that the polygon includes all points, and that we can find an order to connect them where none of the lines intersect. Algorithm: Find the leftmost points p Find the rightmost point q Partition the points into A, the set of points below pq, … Read more
Try this code which makes use of a cross product: public bool isLeft(Point a, Point b, Point c){ return ((b.X – a.X)*(c.Y – a.Y) – (b.Y – a.Y)*(c.X – a.X)) > 0; } Where a = line point 1; b = line point 2; c = point to check against. If the formula is equal … Read more
Here is an easy solution that requires only scipy: def in_hull(p, hull): “”” Test if points in `p` are in `hull` `p` should be a `NxK` coordinates of `N` points in `K` dimensions `hull` is either a scipy.spatial.Delaunay object or the `MxK` array of the coordinates of `M` points in `K`dimensions for which Delaunay triangulation … Read more
Try this code which makes use of a cross product: public bool isLeft(Point a, Point b, Point c){ return ((b.X – a.X)*(c.Y – a.Y) – (b.Y – a.Y)*(c.X – a.X)) > 0; } Where a = line point 1; b = line point 2; c = point to check against. If the formula is equal … Read more