This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Brown Kevin Q., "Geometric Transforms for Fast Geometric Algorithms", PhD thesis, Carnegie-Mellon University, (Dec. 1979), 54–57.
Bhattacharya B. and Toussaint G. T., "A linear algorithm for determining the translation separability of two simple polygons", Tech. Rep. No. SOCS 86.1, McGill University (Jan. 1986).
Bhattacharya B. and Toussaint G. T., "Efficient algorithms for computing the maximum distance between two finite planar sets", Journal of Algorithms,4, (1983), 121–136.
Chazelle B. and Dobkin D., "Detection is easier than computation", Proc. Twelfth Annual ACM Symposium on Theory of Computing, (April 1980) 146–153.
Chazelle B. and al., "The complexity and decidability of separation", Tech. Rep. CS-83-84, University of Waterloo, (Nov. 1983).
Chazelle B., "Computational geometry and convexity", Ph.D. thesis, Carnegie-Mellon University, (July 1980).
Dawson R. J., "On the mobility of bodies in R n", manuscript, Cambridge University, England.
Dawson R. J., "On removing a ball without disturbing the others", Mathematics Magazine, vol. 57, no. 1, (Jan. 1984), 27–30.
Edelsbrunner H., "Computing the extreme distances between two convex polygons", Journal of Algorithms 6,(1985) 213–224.
Lee D. T. and Preparata F. P., "An optimal algorithm for finding the kernel of a polygon", Journal of the ACM 26, (1979), 415–421.
Mansouri M., "On the reachabillity region of a ladder in two convex polygons", Master's Thesis, McGill University, Montreal (August 1986).
McKenna Michael and Toussaint Godfried T., "Finding the minimum vertex distance between two disjoint convex polygons in linear time", Comp. and Maths. with Applications, vol. 11, No. 12, (1985), 1227–1242.
Melville R., "An implementation study of two algorithms for the minimum spanning circle problem", in Computational Geometry, G. T. Toussaint, Ed., North Holland, 1985.
O'Rourke J., et al., "A new linear algorithm for intersecting convex polygons", Computer Graphics and Image Processing, Vol. 19,(1982), 384–391.
Shamos M.I., "Computational Geometry", Ph.D. thesis, Yale University, (1978).
Toussaint G.T., "Movable Separability of sets", in Computational Geometry, Ed., G. T. Toussaint, North Holland, (1985).
Toussaint G.T., "The complexity of movement", IEEE International Symposium on Information Theory, St. Jovite, Canada,(Sept. 1983).
Toussaint G.T., "Solving geometric problems with the rotating calipers", Proc. MELECON, Athens, Greece, (May 1983).
Whitesides S. H., "Computational geometry and motion planning", in Computational Geometry, Ed., G. T. Toussaint, North Holland, (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 International Federation for Information Processing
About this paper
Cite this paper
Mansouri, M., Toussaint, G. (1988). On the reachability region of a ladder in two convex polygons. In: Iri, M., Yajima, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0042805
Download citation
DOI: https://doi.org/10.1007/BFb0042805
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19238-1
Online ISBN: 978-3-540-39164-7
eBook Packages: Springer Book Archive