Recently, it has been shown that tight or almost tight upper bounds for the discrepancy of many geometrically denned set systems can be derived from simple combinatorial parameters of these set systems. Namely, if the primal shatter function of a set system ℛ on an n-point set X is bounded by const. md, then the discrepancy disc (ℛ) = O(n(d−1)/2d) (which is known to be tight), and if the dual shatter function is bounded by const. md, then disc We prove that for d = 2, 3, the latter bound also cannot be improved in general. We also show that bounds on the shatter functions alone do not imply the average (L1)-discrepancy to be much smaller than the maximum discrepancy: this contrasts results of Beck and Chen for certain geometric cases. In the proof we give a construction of a certain asymptotically extremal bipartite graph, which may be of independent interest.