%----------------------------------
% Geometry and Buckets
%----------------------------------
@book
 {dev1,
  author="L. Devroye",
  title="Lecture Notes on Buket Algorithms",
  publisher="Birkhauser",
  year="1986"
}


@techreport
 {gol1,
  author="M. Golin and others",
  title="Randomized data structures for the dynamic closest-pair problem",
  institution="Max-Planck-Institut fur Informatik",
  year="1993",
  number="MPI-I-93-102"
 }


@article
 {nh,
  author="J. Nievergelt and H. Hinterberger",
  title="The grid file: an Adaptable, Symmetric Multikey File Structure",
  journal="ACM Transactions on Database Systems",
  year="1984",
  volume="9",
  number="1",
  pages="38-71"
}

@article
 {reg,
  author="M. Regnier",
  title="Analysis of grid file algorithms",
  journal="BIT",
  year="1985",
  volume="",
  number="",
  pages="335-357"
}



@techreport
 {gol2,
  author="M. Golin and others",
  title="Randomized data structures for the dynamic closest-pair problem",
  institution="Max-Planck-Institut fur Informatik",
  year="1993",
  number="MPI-I-93-102"
 }


@inproceedings
 {rab,
  author="M. Rabin",
  title="Probabilistic Algorithms", 
  booktitle="Algorithms and complexity : new directions and recent results",
  year="1976",
  editor="J Traub",
  pages="21-39",
  address="Pittsburgh",
  publisher="Academic Press"
 }



@article
 {kat,
  author="M. Katz and D. Volper",
  title="Data structures for retrivial on square grids",
  journal="SIAM Journal of Computing",
  year="1986",
  volume="15",
  number="",  
  pages="919-931"
 }

@article
 {yuv,
  author="G. Yuval",
  title="Finding nearest neighbours",
  journal="Information Processing Letters",
  year="1976",
  volume="5",
  number="3",  
  pages="63-65"
 }

@article
 {tam1,
  author="M. Tamminen",
  title="The extendible cell method for closest point problems",
  journal="BIT",
  year="1982",
  volume="1",
  number="",  
  pages="27-41"
 }

@inproceedings
 {dick,
  author="M. Dickerson and R. Scot Drysdale",
  title="Enumerating k Distances for n points in the plane",
  booktitle="7 th ACM Symposium in Computational Geometry",
  year="1991",
  volume="",
  number="",  
  pages="234-238"
 }


@article
 {bart,
  author="F. Bartling and K. Hinrichs",
  title="Probabilistic analysis of an algorithm for solving the k-dimensional
         all-nearest-neighbours problem by projection",
  journal="BIT",
  year="1991",
  volume="31",
  number="",  
  pages="558-565"
 }

@article
 {fort,
  author="S. Fortune and J. Hopcroft",
  title="A note on Rabin's nearest-neighbour algorithm",
  journal="Information Processing Letters",
  year="1979",
  volume="8",
  number="1",  
  pages="20-23"
 }

@article
 {kle,
  author="R. Klette",
  title="On the approximation of convex hulls of finite grid point sets",
  journal="Pattern Recognition Letters",
  year="1983",
  volume="2",
  number="",  
  pages="19-22"
 }

@article
 {man,
  author="M. Mantyla and M. Tamminen",
  title="Localized set operations for solid modeling",
  journal="ACM Computer Graphics",
  year="1983",
  volume="17",
  number="3",  
  pages="279-288"
 }

@article
 {bent,
  author="JL. Bentley and D. Wood",
  title="An optimal worst case algorithm for reporting intersections of 
         rectangles",
  journal="IEEE Transactions on Computers",
  year="1980",
  volume="C-29",
  number="7",  
  pages="571-576"
 }


@incollection
 {dev2,
  author="L. Devroye",
  title="Expected time analysis of algorithms in computational geometry",
  booktitle="Computational Geometry",
  publisher="Elsevier",
  year="1985",
  editor="GT. Toussaint"
 }  

@incollection
 {asan,
  author="T. Asano and M. Edahiro and H. Imai and M. Iri",
  title="Practical use of bucketing techniques in Computational Geometry",
  booktitle="Computational Geometry",
  publisher="Elsevier",
  year="1985",
  editor="G T Toussaint"
 }