Range Searching and Point Location among Fat Objects

Journal of Algorithms

Volumn 21, Issue 3, 1996, Pages 629-656

  Overmars, Mark H ^a   Van Der Stappen, A Frank ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001700602     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0063     Document Type: Article

References (35)

1. P. K. Agarwal, M. J. Katz, and M. Sharir, Computing depth orders and related problems, in "Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT'94)" (E. M. Schmidt and S. Skyum, Eds.), Lecture Notes in Comput. Sci. 824 (1994), 1-12.
2. P. K. Agarwal and J. Matoušek, On range searching with semialgebraic sets, Discrete Comput. Geom. 11 (1994), 393-418.
3. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Näher, S. Schirra, and C. Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures, Algorithmica 8 (1992), 391-406.
4. M. de Berg, M. de Groot, and M. Overmars, New results on binary space partitions in the plane, in "Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT'94)" (E. M. Schmidt and S. Skyum, Eds.), Lecture Notes in Comput. Sci. 824 (1994), 61-72.
5. B. Chazelle, How to search in history, Inform. and Control 64 (1985), 77-99.
6. B. Chazelle, H. Edelsbrunner, L. J. Guibas, and M. Sharir, A singly-exponential stratification scheme for real semi-algebraic varieties and its applications, Theoret. Comput. Sci. 84 (1991), 77-105.
7. B. Chazelle and J. Friedman, Point location among hyperplanes and unidirectional ray shooting, Comput. Geom. Theory Appl. 4 (1994), 53-62.
8. B. Chazelle and L. Guibas, Fractional cascading I: A data structuring technique, Algorithmica 1 (1986), 133-162.
9. B. Chazelle, M. Sharir, and E. Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Algorithmica 8 (1992), 407-429.
10. B. Chazelle and E. Welzl, Quasi-optimal range searching in spaces of finite VC-dimension, Discrete Comput. Geom. 4 (1989), 467-489.
11. K. L. Clarkson, New applications of random sampling in computational geometry, Discrete Comput. Geom. 2 (1987), 195-222.
12. R. Cole, Searching and storing similar lists, J. Algorithms 7 (1986), 202-220.
13. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," Springer-Verlag, Berlin, 1987.
14. H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput. 15 (1986), 317-340.
15. A. Efrat, G. Rote, and M. Sharir, On the union of fat wedges and separating a collection of segments by a line, Comput. Geom. Theory Appl. 3 (1993), 277-288.
16. G. M. Fikhtengol'ts, "The Fundamentals of Mathematical Analysis," Vol. II, English edition, Pergamon, Elmsford, NY, 1965.
17. M. T. Goodrich and R. Tamassia, Dynamic trees and dynamic point location, in "Proc. 23rd ACM Symp. on Theory of Computing, 1991," pp. 523-533.
18. D. Halperin and M. H. Overmars, Spheres, molecules, and hidden surface removal, in "Proc. 10th Ann. ACM Symp. on Computational Geometry, 1994," pp. 113-122.
19. M. J. Katz, M. H. Overmars, and M. Sharir, Efficient hidden surface removal for objects with small union size, Comput. Geom. Theory Appl. 2 (1992), 223-234.
20. D. G. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput. 12 (1983), 28-35.
21. M. van Kreveld, "New results on data structures in computational geometry," Ph.D. thesis, Dept. of Computer Science, Utrecht University, 1992.
22. M. van Kreveld, "On Fat Partitioning, Fat Covering and the Union Size of Polygons," Technical Report RUU-CS-93-36, Dept. of Computer Science, Utrecht University, 1993.
23. K. Leichtweiss, Über die affine Exzentrizität konvexer Körper, Arch. der Mathematik 10 (1959), 187-199. [In German]
24. J. Matoušek, Efficient partition trees, Discrete Comput. Geom. 8 (1992), 315-334.
25. J. Matoušek, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom. 10 (1993), 157-182.
26. 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.
27. K. Mehlhorn and S. Näher, Dynamic fractional cascading, Algorithmica 5 (1990), 215-241.
28. M. H. Overmars, Point location in fat subdivisions, Inform. Process. Lett. 44 (1992), 261-265.
29. M. H. Overmars and A. F. van der Stappen, Range searching and point location among fat objects, in "Proc. 2nd Annual European Symp. on Algorithms (ESA'94)" (J. van Leeuwen, Ed.), Lecture Notes in Comput. Sci. 855 (1994).
30. F. P. Preparata and M. I. Shamos, "Computational Geometry: An Introduction," Springer-Verlag, New York, 1985.
31. F. P. Preparata and R. Tamassia, Efficient spatial point location, in "Proc. 1st Workshop on Algorithms and Data Structures," Lecture Notes in Comput. Sci. 382 (1989), 3-11.
32. 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 (1993), 353-373.
33. A. F. van der Stappen and M. H. Overmars, Motion planning amidst fat obstacles, in "Proc. 10th ACM Symp. on Computational Geometry, 1994," pp. 31-40.
34. A. F. van der Stappen, "Motion Planning amidst Fat Obstacles," Ph.D. thesis, Dept. of Computer Science, Utrecht University, 1994.
35. W. Walter, "Analysis II (Grundlagen Mathematik Bd. 4)," Springer-Verlag, Berlin, 1990. [In German]