How to speed up an N dimensional interval tree in python?

Question

Consider the following problem: Given a set of n intervals and a set of m floating-point numbers, determine, for each floating-point number, the subset of inte