Preview
Unable to display preview. Download preview PDF.
References
T. Asano, T. Asano, L. Guibas, J. Hershberger and H. Imai: “Visibility of disjoint polygons.” Algorithmica, 1 (1986), pp. 49–63.
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.
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.
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.
K. Mehlhorn: “Data Structures and Algorithms”, Vol.3, Springer Verlag, 1984.
F.Preparata and I.Shamos: “Computational Geometry, an Introduction”, Springer Verlag, 1985.
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.
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).
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.
E. Welzl: “Constructing the visibility graph for n line segments in the plane”, Inf. Proc. Letters, 20 (1985), pp.167–171.
Author information
Authors and Affiliations
Editor information
Rights 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