Abstract
We address the problem of a succinct static data structure representing points on an M x M grid (M = 2m 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 L1 norm in constant time. Our data structure takes essentially minimum space. These results are extended to d dimensions under L∞.
Cite
CITATION STYLE
APA
Brodnik, A., & Munro, J. I. (1996). Neighbours on a Grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1097, pp. 309–320). Springer Verlag. https://doi.org/10.1007/3-540-61422-2_141
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free