Neighbours on a Grid

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1097, Issue , 1996, Pages 309-320

  Brodnik, Andrej ^a   Munro, J Ian ^b  

^a LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

CONSTANT TIME; D DIMENSIONS; L1 NORM; QUERY POINTS;

QUERY PROCESSING;

EID: 84860885246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_141     Document Type: Conference Paper

References (29)

1. S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writting. In 3 rd ACM-SIAM Symposium on Discrete Algorithms, pages 463-472, Orlando, Florida, 1992.
2. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in linear time? In 27 th ACM Symposium on Theory of Computing, pages 427-436, Las Vegas, Nevada, 1995.
3. J.L. Bentley and J.H. Friedman. Data structures for range searching. ACM Computing Surveys, 11(4):397-409, 1979.
4. J.L. Bentley and H.A. Maurer. Efficient worst-case data structures for range searching. Acta Informatica, 13:155-168, 1980.
5. J.L. Bentley, B.W. Weide, and A.C. Yao. Optimal expected-time algorithms for closest-point problems. ACM Transactions on Mathematical Software, 6(4):563-580, December 1980.
6. A. Brodnik. Searching in Constant Time and Minimum Space (MINIMÆREs MAGNI MOMETI SUNT). PhD thesis, University of Waterloo, Waterloo, Ontario, Canada, 1995. (Also published as technical report CS-95-41.).
7. C.-C. Chang and T.-C. Wu. A hashing-oriented nearest neighbor searching scheme. Pattern Recognition Letters, 14(8):625-630, August 1993.
8. B. Chazelle. An improved algorithm for the fixed-radius neighbor problem. Information Processing Letters, 16(4):193-198, May 13 th 1983.
9. B. Chazelle, R. Cole, EP. Preparata, and C. Yap. New upper bounds for neighbor searching. Information and Control, 68(1-3): 105-124, 1986.
10. Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proceedings of the IEEE, 80(9):1412-1434, September 1992.
11. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Massachusetts, 1990.
12. C.R. Dyer and A. Rosenfeld. Parallel image processing by memory-augmented cellular automata. IEEE Transactions on Pattern Analysis and Machine Intelligence, 3(1):29-41, January 1981.
13. H. Edelsbrunner. Algorithms in Combinatorial Geometry. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, 1987.
14. P. van Evade Boas. Machine models and simulations. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 1, pages 1-66. Elsevier, Amsterdam, Holland, 1990.
15. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10(1):99-127, 1977.
16. A. Farag6, T. Linder, and G. Lugosi. Nearest neighbor search and classification in O(1) time. Problems of Control and Information Theory, 20:383-395, 1991.
17. M.L. Fredman and D.E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.
18. R.G. Karlsson. Algorithms in a Restricted Universe. PhD thesis, University of Waterloo, Waterloo, Ontario, Canada, 1984, (Also published as technical report CS-84-50.).
19. R.G. Karlsson, J.I. Munro, and E.L. Robertson. The nearest neighbor problem on bounded domains. In W. Brauer, editor, Proceedings 12 th International Colloquium on Automata, Languages and Programming, volume 194 of Lecture Notes in Computer Science, pages 318-327. Springer-Verlag, 1985.
20. D.E. Knuth. TheArt of Computer Programming: Sorting and Searching, volume 3. Addison- Wesley, Reading, Massachusetts, 1973.
21. D.T. Lee and C.K. Wong. Voronoidiagrams in L1 (L∞) metrics with 2-storage applications. SlAM Journal on Computing, 9(1):200-211, February 1980.
22. K. Mehlhom. Data Structures and Algorithms: Multi.dimensional Searching and Computational Geometry, volume 3. Springer-Verlag, Berlin, 1984.
23. R. Miller and Q.E Stout. Geometric algorithms for digitized pictures on a mesh-connected computer. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(2):216-228, March 1985.
24. P.B. Miltersen. Lower bounds for union-split-find related problems on random access machines. In 26 th A CM Symposium on Theory of Computing, pages 625-634, Montrral, Qurbec, Canada, 1994.
25. O.J. Murphy and S.M. Selkow. The efficiency ofusingk-d trees for finding nearest neighbors in discrete space. Information Processing Letters, 23(4):215-218, November 8 th 1986.
26. EP. Preparata and M.I. Shamos. Computational Geometry. Texts and Monographs in Computer Science. Springer-Verlag, Berlin, 2 nd edition, 1985.
27. V. Ramasubramanian and K.K. Paliwal. An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation. Pattern Recognition Letters, 13(7):471-480, July 1992.
28. R.F. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6:579-589, 1991.
29. F.E Yao. Computational geometry. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 7, pages 343-389. Elsevier, Amsterdam, Holland, 1990.