Algorithm 1 Strategy 1: Predictions with hand.

Input: Hand position $P_h\in {\mathbb{R}}^3$.

Output: Best point $P\ast$ in the set of $P_i$, $i=1\dots 16$.

1: Build a k-d tree for all points $P_i$ in the scene.

2: function ST1($P_h$)

3:     Using hand pose as a query point q, return nearest point from the k-d tree.

4:     return $P\ast$

5: end function