I have a list of 2d points [(x1,y1),(x2,y2),...,(xn,yn)]
in numpy, how do I get a list of points within the bounding box specified by the corners ((bx1,by1),(bx2,by2))
?
If this were C++ I would use the OGC "within" specification in boost geometry to filter the list.
Right now I'm just dealing with a list of indexes into an NxN 2d numpy array, so I expect this should just be 1-2 lines of code with numpy.
Using a combination of all
, logical_and
and the <=
operator, one
can express the main idea in 1 line.
import random
import numpy as np
from matplotlib import pyplot
points = [(random.random(), random.random()) for i in range(100)]
bx1, bx2 = sorted([random.random(), random.random()])
by1, by2 = sorted([random.random(), random.random()])
pts = np.array(points)
ll = np.array([bx1, by1]) # lower-left
ur = np.array([bx2, by2]) # upper-right
inidx = np.all(np.logical_and(ll <= pts, pts <= ur), axis=1)
inbox = pts[inidx]
outbox = pts[np.logical_not(inidx)]
# this is just for drawing
rect = np.array([[bx1, by1], [bx1, by2], [bx2, by2], [bx2, by1], [bx1, by1]])
pyplot.plot(inbox[:, 0], inbox[:, 1], 'rx',
outbox[:, 0], outbox[:, 1], 'bo',
rect[:, 0], rect[:, 1], 'g-')
pyplot.show()
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With