We address the problem of a succinct static data structure representing points on an M × M grid (M = 2^m where m is size of a word) that permits to answer the question of finding the closest point to a query point under the L _∞ or L ₁ norm in constant time. Our data structure takes essentially minimum space. These results are extended to d dimensions under L _∞.