 | Jan van Leeuwen - 1994 - 536 Seiten
...Structures, Lecture Notes in Computer Science 382 (1989), pp. 3-1 1 . 19. AF VAN DER STAPPEN, D. HALPERIN, MH OVERMARS, The complexity of the free space for a robot moving amidst fat obstacles, Computational Geometry, Theory and Applications 3(1993), pp. 353-373. 20. AF VAN DER STAPPEN AND MH... | |
 | Kanchana Kanchanasut, Jean-Jacques Levy - 1995 - 428 Seiten
...on polyhedra using binary space partitioning trees. In Proc. SIGGRAPH'87, pages 153-162, 1987. 20. AF van der Stappen, D. Halperin, and MH Overmars....moving amidst fat obstacles. Comput. Geom. Theory and Appl., 3:353-373, 1993. 21. P. van Oosterom. A modified binary space partition for geographic information... | |
 | Frank Dehne - 1997 - 492 Seiten
...van der Stappen, Motion Planning amidst Fat Obstacle*, Ph.D. thesis, Utrecht University, 1994. [27] AF van der Stappen, D. Halperin and MH Overmars, The...free space for a robot moving amidst fat obstacles, Computational Geometry: Theory and Applications 3 (1993), 353-373. [28] AF van der Stappen and MH Overmars,... | |
 | Csaba D. Toth, Joseph O'Rourke, Jacob E. Goodman - 2004 - 1557 Seiten
...and W. Maass. Motion planning among time-dependent obstacles. Acta Inform.. 26:93-122. 1988. [vdS+93j AF van der Stappen. D. Halperin. and MH Overmars....obstacles. Comput. Geom. Theory Appl.. 3:353373. 1993. [vdS+98] AF van der Stappen. MH Overmars. M. de Berg, and J. Vleugels. Motion planning in environments... | |
 | Weihua Yang - 2008 - 374 Seiten
...barriers, Proceeding 1st ACM Symposium on Computational Geometry, 1985. [7] F. Stappen, D. Halperin, M. Overmars, The complexity of the free space for a robot moving amidst fat obstacles, Computational Geometry, 3, 1993. [8] S. Sifrony, M. Sharir, A new efficient motion-planning algorithm... | |
| |
Halperin, and MH Overmars. The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom. Theory Appl., 3:353-373, 1993. 