Let H be an arbitrary family of hyper-planes in d-dimensions. We show that the point-location problem for H
can be solved by a linear decision tree that only uses a special type of queries called \emph{generalized comparison queries}. These queries correspond to hyperplanes that can be written as a linear ... more >>>