Range searching in low-density environments

Information Processing Letters

Volumn 60, Issue 3, 1996, Pages 121-127

  Schwarzkopf, Otfried ^a   Vleugels, Jules ^b  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Computational geometry; Fat objects; Low density; Motion planning; Point location; Range searching

Indexed keywords

DATA STRUCTURES; MOTION PLANNING; OBJECT ORIENTED PROGRAMMING; QUERY LANGUAGES;

FAT OBJECTS; LOW DENSITY ENVIRONMENTS; POINT LOCATION; RANGE SEARCHING;

COMPUTATIONAL GEOMETRY;

EID: 0030287041     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00154-8     Document Type: Article

References (10)

1. A. Efrat, M. Sharir and G. Rote, On the union of fat wedges and separating a collection of segments by a line, Comput. Geom. Theory Appl. 3 (1994) 277-288.
2. M.J. Katz, M. Overmars and M. Sharir, Efficient output sensitive hidden surface removal for objects with small union size, Comput. Geom. Theory Appl. 2 (1992) 223-234.
3. J. Matoušek, J. Pach, M. Sharir, S. Sifrony and E. Welzl, Fat triangles determine linearly many holes, SIAM J. Comput. 23 (1994) 154-169.
4. M.H. Overmars, Point location in fat subdivisions, Inform. Process. Lett. 44 (1992) 261-265.
5. M.H. Overmars and A.F. van der Stappen, Range searching and point location among fat objects, in: J. van Leeuwen, ed., Algorithms - ESA'94, Utrecht, NL, 1994, Lecture Notes in Computer Science 855 (Springer, Berlin) 240-253
6. Ph. Pignon, Structuration de l'espace pour une planification hiérarchisée des trajectoires de robots mobiles, Ph.D. Thesis, LAAS-CNRS and Université Paul Sabatier de Toulouse, Toulouse, France, 1993.
7. J.T. Schwartz and M. Sharir, Efficient motion planning algorithms in environments of bounded local complexity, Rept. 164, Dept. of Computer Science, Courant Inst. Math. Sci., New York University, New York, NY, 1985.
8. A.F. van der Stappen, Motion planning amidst fat obstacles, Ph.D. Thesis, Dept. of Computer Science, Utrecht University, Utrecht, The Netherlands, 1994.
9. A.F. van der Stappen, D. Halperin and M.H. Overmars, The complexity of the free space for a robot moving amidst fat obstacles, Comput. Geom. Theory Appl. 3 91993) 353-373.
10. M. van Kreveld, On fat partitioning, fat covering and the union size of polygons, in; Proc. 3rd Workshop on Algorithms Data Struct., Lecture Notes on Computer Science 709 (Springer, Berlin, 1993) 452-463.