Translating a regular grid over a point set

Computational Geometry: Theory and Applications

Volumn 25, Issue 1-2, 2003, Pages 21-34

  Bose, Prosenjit ^a   Van Kreveld, Marc ^b   Maheshwari, Anil ^a   Morin, Pat ^a   Morrison, Jason ^a  

^a CARLETON UNIVERSITY   (Canada)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Binary tree; Dynamic data structure; Facility location; Intervals; Lazy update; Maintenance of functions

Indexed keywords

EID: 84867956826     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00128-1     Document Type: Article

References (11)

1. P.K. Agarwal, B.K. Bhattacharya, and S. Sen Output-sensitive algorithms for uniform partitions of points A. Aggarwal, C.P. Rangan, Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC Lecture Notes in Computer Science 1741 1999 Springer Berlin 403 414
2. T. Asano, and T. Tokuyama Algorithms for projecting points to give the most uniform distribution with applications to hashing Algorithmica 9 6 1993 572 590
3. J.L. Bentley, Solutions to Klee's rectangle problems, Technical Report, Carnegie-Mellon University, 1977
4. J.L. Bentley, and T.A. Ottmann Algorithms for reporting and counting geometric intersections IEEE Trans. on Comput. C 28 1979 643 647
5. D. Comer, and M.J. O'Donnell Geometric problems with applications to hasing SIAM J. Comput. 11 2 1982 217 226
6. T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 MIT Press Cambridge, MA
7. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications 1997 Springer-Verlag Berlin
8. J.R. Driscoll, N. Sarnak, D.D. Sleator, and R.E. Tarjan Making data structures persistent J. Comput. System Sci. 38 1 1989 86 124
9. J. Hershberger Finding the upper envelope of n line segments in O(nlogn) time Inform. Process. Lett. 33 4 1989 169 174
10. D.T. Lee Maximum clique problem of rectangle graphs F.P. Preparata, Advances in Computing Research 1983 JAI Press 91 107
11. M.J. van Kreveld, and M.H. Overmars Concatenable segment trees (extended abstract) B. Monien, R. Cori, Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science 349 1989 Springer Berlin 493 504