Summary: We present a simple scheme extending the shallow partitioning data structures of Matoušek, which supports efficient approximate halfspace range-counting queries in \(\mathbb R^d\) with relative error \(\varepsilon\). Specifically, the problem is, given a set \(P\) of \(n\) points in \(\mathbb R^d\), to preprocess them into a data structure that returns, for a query halfspace \(h\), a number \(t\) so that \((1-\varepsilon)|h\cap P|\leq t\leq (1+\varepsilon)|h\cap P|\). One of our data structures requires linear storage and \(O(n^{1+\delta})\) preprocessing time, for any \(\delta >0\), and answers a query in time \(O(\varepsilon^{-\gamma}n^{1-1/\lfloor d/2\rfloor}2^{b\log^\ast n})\) for any \(\gamma>2/\lfloor d/2\rfloor\); the choice of \(\gamma\) and \(\delta\) affects \(b\) and the implied constants. Several variants and extensions are also discussed. As presented, the construction of the structure is mostly deterministic, except for one critical randomized step, and so are the query, storage, and preprocessing costs. The quality of approximation, for every query, is guaranteed with high probability. The construction can also be fully derandomized, at the expense of increasing preprocessing time.