Consider a set $$P\subseteq \mathbb {R}^d$$ of n points, and convex body $$C$$ provided via separation oracle. The task at hand is to decide for each point $$P$$ if it in using the fewest number oracle queries. We show that one can solve this problem two three dimensions queries, where size largest subset points position. In 2D, we provide an algorithm efficiently generates these adaptive Fu...