Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 1990: SWAT 90 pp 97–110Cite as

The visibility diagram: A data structure for visibility problems and motion planning

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 447))

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. T. Asano, T. Asano, L. Guibas, J. Hershberger and H. Imai: “Visibility of disjoint polygons.” Algorithmica, 1 (1986), pp. 49–63.

    Google Scholar 

  2. B.Chazelle and L.Guibas: “Visibility and intersection problems in plane geometry.” Proceedings of the ACM Symposium on Computational Geometry, Baltimore, 1985, pp. 135–146.

    Google Scholar 

  3. Y. Ke and J. O'Rourke: ”Lower bounds on moving a ladder in two and three dimensions”, Discrete and Computational Geometry, 3 (1987), pp. 197–218.

    Google Scholar 

  4. D. Leven and M. Sharir: “An efficient and simple motion-planning algorithm for a ladder moving in 2-dimensional space amidst polygonal barries”, J. Algorithms, 8 (1987), pp. 192–215.

    Google Scholar 

  5. K. Mehlhorn: “Data Structures and Algorithms”, Vol.3, Springer Verlag, 1984.

    Google Scholar 

  6. F.Preparata and I.Shamos: “Computational Geometry, an Introduction”, Springer Verlag, 1985.

    Google Scholar 

  7. S. Sifrony and M. Sharir: ”A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space”, Algorithmica, 2 (1987), pp. 367–402.

    Article  Google Scholar 

  8. G. Vegter: ”The Visibility Diagram: a Data Structure for Visibility and Motion Planning Problems, Part 1: Application to the Visibility Polygon Query Problem”, Techn. Report CS8913, Univ. of Groningen (1989).

    Google Scholar 

  9. C.K. Yap: “Algorithmic Motion planning”, in: Advances in Robotics, ed. J.T. Schwarz and C.K. Yap (1987), Lawrence Erlbaum Ass., Publ., Hillsdale NJ, London.

    Google Scholar 

  10. E. Welzl: “Constructing the visibility graph for n line segments in the plane”, Inf. Proc. Letters, 20 (1985), pp.167–171.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing Science, University of Groningen, P.O.Box 800, 9700 AV, Groningen, The Netherlands

    Gert Vegter

Authors
  1. Gert Vegter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John R. Gilbert Rolf Karlsson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vegter, G. (1990). The visibility diagram: A data structure for visibility problems and motion planning. In: Gilbert, J.R., Karlsson, R. (eds) SWAT 90. SWAT 1990. Lecture Notes in Computer Science, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52846-6_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-52846-6_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52846-3

  • Online ISBN: 978-3-540-47164-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation