Models and motion planning

Computational Geometry: Theory and Applications

Volumn 23, Issue 1, 2002, Pages 53-68

  De Berg, Mark ^a   Katz, Matthew J ^b   Overmars, Mark H ^a   van Der Stappen, A Frank ^a   Vleugels, Jules ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Free space complexity; Input models; Motion planning

Indexed keywords

EID: 31244433187     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00022-0     Document Type: Article

References (21)

1. P.K. Agarwal, M.J. Katz, M. Sharir, Computing depth orders for fat objects and related problems, Computational Geometry 5 (1995) 187-206.
2. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Näher, S. Schirra, C. Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures, Algorithmica 8 (1992) 391-401.
3. J.M. Banon, Implementation and extension of the ladder algorithm, in: Proc. IEEE Internat. Conf. Robot. Autom., 1990, pp. 1548-1553.
4. M. de Berg, Linear size binary space partitions for uncluttered scenes, Algorithmica 28 (2000) 353-366.
5. M. de Berg, M.J. Katz, A.F. van der Stappen, J. Vleugels, Realistic input models for geometric algorithms, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 294-303.
6. M. de Berg, H. David, M.J. Katz, M. Overmars, A.F. van der Stappen, J. Vleugels, Guarding scenes against invasive hypercubes, Technical Report UU-CS-2000-40, Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands, 2000.
7. A. Efrat, M.J. Katz, On the union of κ-curved objects, Computational Geometry 14 (1999) 241-254.
8. A. Efrat, M.J. Katz, F. Nielsen, M. Sharir, Dynamic data structures for fat objects and their applications, Computational Geometry 15 (2000) 215-227.
9. M.J. Katz, 3-D Vertical ray shooting and 2-d point enclosure, range searching, and arc shooting amidst convex fat objects, Computational Geometry 8 (1997) 299-316.
10. M.J. Katz, M.H. Overmars, M. Sharir, Efficient hidden surface removal for objects with small union size, Computational Geometry 2 (1992) 223-234.
11. J. Matouiek, J. Pach, M. Sharir, S. Sifrony, E. Welzl, Fat triangles determine linearly many holes, SIAM J. Comput. 23 (1994) 154-169.
12. J.S.B. Mitchell, D.M. Mount, S. Suri, Query-sensitive ray shooting, Internat. J. Comput. Geom. Appl. 7 (1997) 317-347.
13. M.H. Overmars, A.F. van der Stappen, Range searching and point location among fat objects, J. Algorithms 21 (1996) 629-656.
14. J.T. Schwartz, M. Sharir, On the "piano movers" problem I: The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers, Commun. Pure Appl. Math. 36 (1983) 345-398.
15. O. Schwarzkopf, J. Vleugels, Range searching in low-density environments, Inform. Process. Lett. 60 (1996) 121-127.
16. A.F. van der Stappen, D. Halperin, M.H. Overmars, The complexity of the free space for a robot moving amidst fat obstacles, Computational Geometry 3 (1993) 353-373.
17. A.F. van der Stappen, The complexity of the free space for motion planning amidst fat obstacles, J. Intell. Robotic Syst. 11 (1994) 21-44.
18. A.F. van der Stappen, Motion planning amidst fat obstacles, Ph.D. Thesis, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1994.
19. A.F. van der Stappen, M.H. Overmars, Motion planning amidst fat obstacles, in: Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994, pp. 31-40.
20. A.F. van der Stappen, M.H. Overmars, M. de Berg, J. Vleugels, Motion planning in environments with low obstacle density, Discrete Comput. Geom. 20 (1998) 561-587.
21. J. Vleugels, On fatness and fitness-Realistic input models for geometric algorithms, Ph.D. Thesis, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1997.