1. Data Structures for Range Searching
2. and , ‘Geometric intersection problems’, 17th Annual Symposium on Foundations of Computer Science, IEEE, New York, 1976.
3. NATO ASI Seri;Earnshaw,1985
4. A vectorized “near neighbors” algorithm of order N using a monotonic logical grid
5. Sedgewick, Algorithms, 2nd edn, Addison-Wesley, Reading, MA, 1988.