A technique for adding range restrictions to generalized searching problems

Information Processing Letters

Volumn 64, Issue 5, 1997, Pages 263-269

  Gupta, Prosenjit ^a   Janardan, Ravi ^b   Smid, Michiel ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b University of Minnesota   (United States)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Computational geometry; Data structures; Intersection searching; Range restriction

Indexed keywords

EID: 0012726648     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00183-x     Document Type: Article

References (11)

1. P.K. Agarwal, M. van Kreveld, Polygon and connected component intersection searching, Algorithmica 15 (1996) 626-660.
2. J.L. Bentley, Decomposable searching problems, Inform. Process. Lett. 8 (1979) 244-251.
3. P. Gupta, R. Janardan, M. Smid, On intersection searching problems involving curved objects, in: Proc. 4th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 824, Springer, Berlin, 1994, pp. 183-194.
4. P. Gupta, R. Janardan, M. Smid, Further results on generalized intersection searching problems: counting, reporting and dynamization, J. Algorithms 19 (1995) 282-317.
5. P. Gupta, R. Janardan, M. Smid, Algorithms for generalized halfspace range searching and other intersection searching problems, Comput. Geom. Theory Appl. 5 (1996) 321-340.
6. R. Janardan, M. Lopez, Generalized intersection searching problems, Internat. J. Comput. Geom. Appl. 3 (1993) 39-69.
7. M. Katz. 3-D vertical ray shooting and 2-D point enclosure, range searching and arc shooting amidst convex fat objects, Report INRIA, Nr. 2583, 1995.
8. M. van Kreveld, New results on data structures in computational geometry, Ph.D. Thesis, Dept. of Computer Science, University of Utrecht, The Netherlands, 1992.
9. H.-P. Lenhof, M. Smid, Using persistent data structures for adding range restrictions to searching problems, RAIRO Theoret. Inform. Appl. 28 (1994) 25-49.
10. H.W. Scholten, M.H. Overmars, General methods for adding range restrictions to decomposable searching problems, J. Symbolic Comput. 7 (1989) 1-10.
11. D.E. Willard, G.S. Lueker, Adding range restriction capability to dynamic data structures, J. ACM 32 (1985) 597-617.