Skip to main content
SpringerLink
Log in
Book cover

Theoretical Foundations of Computer Graphics and CAD pp 639–672Cite as

Some Collision Avoidance Problems in the Plane

  • Conference paper

  • 477 Accesses

Part of the book series: NATO ASI Series ((NATO ASI F,volume 40))

Abstract

Spurred by developments in spatial planning in robotics, computer graphics, and VLSI layout, considerable attention has been devoted recently to the problem of moving sets of objects, such as line segments and polygons in the plane or polyhedra in three dimensions, without allowing collisions between the objects. One class of such problems considers the separability of sets of objects under different kinds of motions and various definitions of separation. This paper surveys this new area of research in a tutorial fashion, presents new results, and provides a list of open problems and suggestions for further research for the case of two dimensions only.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Moser, “Problem 66–11: Moving furniture through a hallway”, SIAM Review ,vol. 8, 1966, p. 381.

    Article  Google Scholar 

  2. M. Goldberg, “A solution of problem 66–11: Moving furniture through a hallway”, SIAM Review ,vol. 11, 1969, pp. 75–78.

    Article  Google Scholar 

  3. J. Sebastian, “A solution to problem 66–11: Moving furniture through a hallway”, SIAM Review ,vol. 12, 1970, pp. 582–586.

    Article  Google Scholar 

  4. W. E. Howden, “The sofa problem”, Computer Journal ,vol. 11, 1968, pp. 299–301.

    Article  MATH  Google Scholar 

  5. K. Maruyama, “An approximation method for solving the sofa problem”, International Journal of Computer and Information Sciences ,vol. 2, 1973, pp. 29–48.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. Lozano-Perez and M. Wesley, “An algorithm for planning collision-free paths among polyhedral obstacles”, Communications of the ACM ,vol. 22, 1979, pp. 560–570.

    Article  Google Scholar 

  7. S. Whitesides, “Computational geometry and motion planning”, in Computational Geometry ,Ed., G. Toussaint, North-Holland, 1985.

    Google Scholar 

  8. L. J. Guibas and F. F. Yao, “On translating a set of rectangles”, Proc. Twelfth Annual ACM Symposium on Theory of Computing ,1980, pp. 154–160.

    Chapter  Google Scholar 

  9. T. Ottman and P. Widmayer, “On translating a set of line segments”, Computer Vision, Graphics, and Image Processing ,vol. 24, 1983, pp. 382–389.

    Article  Google Scholar 

  10. G. T. Toussaint, “The complexity of movement”, IEEE International Symposium on Information Theory ,St. Jovite, Canada, September 1983.

    Google Scholar 

  11. J.-R. Sack and G. T. Toussaint, “Movability of objects”, IEEE Inter national Symposium on Information Theory ,St. Jovite, Canada, September 1983.

    Google Scholar 

  12. G. T. Toussaint and J.-R. Sack, “Some new results on moving polygons in the plane”, Proc. Robotic Intelligence and Productivity Conference ,Detroit, Michigan, Nov. 18–19, 1983, pp. 158–163.

    Google Scholar 

  13. B. Chazelle, et al., “The complexity and decidability of SEPARATION”, Technical Report CS-83-34, University of Waterloo, November 1983.

    Google Scholar 

  14. G. T. Toussaint, “On a simple Minkowski metric classifier”, IEEE Trans. Systems Science and Cybernetics ,vol. SSC-6, October 1970, pp. 360–362.

    Article  Google Scholar 

  15. G. T. Toussaint, “Polynomial representation of classifiers with independent discrete-valued features”, IEEE Trans. Computers ,vol. C-21, February 1972, pp. 205–208.

    Article  MathSciNet  Google Scholar 

  16. J. Stoer and C. Witzgall, Convexity and Optimization in Finite Dimensions I ,Springer-Verlag, 1970.

    Google Scholar 

  17. G. T. Toussaint, “A hierarchy of simple polygons”, manuscript in preparation.

    Google Scholar 

  18. G. T. Toussaint, “Complexity, convexity, and unimodality”, Int. Jour nal of Computer and Information Sciences ,in press.

    Google Scholar 

  19. T. M. Cover, “Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition”, IEEE Trans. Electronic Computers ,vol. EC-14, June 1965, pp. 326–334.

    Article  Google Scholar 

  20. G. T. Toussaint, “On translating a set of spheres”, Tech. Report, SOCS-84.4, School of Computer Science, McGill University, March 1984.

    Google Scholar 

  21. G. Strang, “The width of a chair”, The American Mathematical Monthly ,vol. 89, no. 8, October 1982, pp. 529–534.

    Article  MATH  MathSciNet  Google Scholar 

  22. G. T. Toussaint, “Solving geometric problems with the rotating calipers”, Proc. IEEE MELECON 83 , Athens, Greece, May 1983.

    Google Scholar 

  23. M. Houle and G. T. Toussaint, “Computing the width of a set”, manuscript in preparation.

    Google Scholar 

  24. M. E. Dyer, “Linear time algorithms for two-and three-variable linear programs”, SIAM Journal of Computing ,vol. 13, no. 1, February 1984, pp. 31–45.

    Article  MATH  MathSciNet  Google Scholar 

  25. D. T. Lee and F. P. Preparata, “An optimal algorithm for finding the kernel of a polygon”, Journal Ass. Comput. Mach. , vol. 26, no. 3, 1979, pp. 415–421.

    Article  MATH  MathSciNet  Google Scholar 

  26. J. R. Sack and G. T. Toussaint, “Movability of polygons in the plane”, Proc. STACS ,Saarbrücken, January, 1985.

    Google Scholar 

  27. R. J. Dawson, “On removing a ball without disturbing the others”, Mathematics Magazine ,vol. 57, no. 1, January 1984, pp. 27–30.

    Article  MATH  MathSciNet  Google Scholar 

  28. G. T. Toussaint and H. A. El Gindy, “Two monotone polygons can be separated in linear time”, Tech. Rept. S0CS-84.7, School of Computer Science, McGill University, May 1984.

    Google Scholar 

  29. F. P. Preparata and K. Supowit, “Testing a simple polygon for monotonicity”, Information Processing Letters ,vol. 12, 1981, pp. 161–164.

    Article  MathSciNet  Google Scholar 

  30. H. El Gindy and D. Avis, “A linear algorithm for computing the visibility polygon from a point”, Journal of Algorithms ,vol. 2, 1981, pp. 186–197.

    Article  MATH  MathSciNet  Google Scholar 

  31. D. T. Lee, “Visibility of a simple polygon” Computer Vision, Graphics ,and Image Processing ,vol. 22, 1983, pp. 207–221.

    Article  MATH  Google Scholar 

  32. M. I. Shamos and D. Hoey, “Geometric intersections problems”, Seven teenth Annual IEEE Symposiums on Foundations of Computer Science, October 1976, pp. 208–215.

    Google Scholar 

  33. L. J. Guibas and J. Stolfi, Notes on Computational Geometry ,XEROX PARK and Stanford University, 1982.

    Google Scholar 

  34. R. J. Dawson, “On the mobility of bodies in IR n”, manuscript, Cambridge University, England.

    Google Scholar 

  35. G. T. Toussaint and H. A. El Gindy, “Separation of two monotone polygons in linear time”, Robotica ,in press.

    Google Scholar 

  36. H. Edelsbrunner, M. H. Overmars, and R. Seidel, “Some methods of computational geometry applied to computer graphics”, Tech. Rept. F117, Technical University of Graz, June 1983.

    Google Scholar 

  37. M. McKenna and R. Seidel, “Shadows of convex polyhedra”, Proc. Symposium on Computational Geometry ,Baltimore, June 1985.

    Google Scholar 

  38. J. R. Sack, “Rectilinear computational geometry”, Ph.D. thesis, School of Computer Science, McGill University, Montreal, 1984.

    Google Scholar 

  39. G. T. Toussaint, “Shortest path solves translation separability of polygons”, Proc. Intelligent Autonomous Systems, Amsterdam 8–10 Dec, 1986.

    Google Scholar 

  40. R. E. Tarjan and C. J. Van Wyk, “An 0(n log log n) time algorithm for triangulating simple polygons”, SIAM J. on Computing ,in press.

    Google Scholar 

  41. T. Asano, “Separability of two simple polygons”, Osaka Electro-Communication University, internal manuscript, November 1985.

    Google Scholar 

  42. B. K. Bhattacharya and G. T. Toussaint, “An 0(n loglog n) time algorithm for determining translation separability of two simple polygons,” Tech. Rept. SOCS 86.1, McGill University, January 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. McGill University, Montreal, Canada

    Godfried Toussaint

Authors
  1. Godfried Toussaint
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Leeds, UK

    Rae A. Earnshaw

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Toussaint, G. (1988). Some Collision Avoidance Problems in the Plane. In: Earnshaw, R.A. (eds) Theoretical Foundations of Computer Graphics and CAD. NATO ASI Series, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83539-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83539-1_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83541-4

  • Online ISBN: 978-3-642-83539-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation