What is a faster way of finding unique x,y points (removing duplicates) in a numpy array like:
points = numpy.random.randint(0, 5, (10,2))
I thought of converting points to a complex numbers and then checking for unique, but that seems rather convoluted:
b = numpy.unique(points[:,0] + 1j * points[:,1])
points = numpy.column_stack((b.real, b.imag))
See Question&Answers more detail:
os 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…