Abstract
The polygon containment problem is the problem of deciding whether one polygon, C, can be translated to fit within another polygon N. We present an algorithm that runs in time O (cn log cn) to solve this problem, in the case that the polygon C is convex. Here c is the number of bounding edges of C, and n is the number of bounding edges of N. The algorithm actually computes the feasible region, that is, a description of the set of all placements of C inside N. The algorithm is close to optimal in that the feasible region may have O (cn) vertices.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
4. References
A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1975.
R. Brooks, “Solving the Find-Path Problem by Good Representation of Free Space,“ IEEE Transactions on Systems, Man, and Cybernetics 13(3) pp. 190–197 (1983).
B. Baker, S. Fortune, S. Mahaney, “Inspection by Polygon Containment,“ Twenty-Second Annual Allerton Conference on Communication, Control. and Computing, October, 1984, submitted to J. Algorithms.
J.L. Bentley, T.A. Ottmann, “Algorithms for Reporting and Counting Geometric Intersections”, IEEE Transactions on Computers, C-28, pp. 643–647, (1979).
B. Chazelle, “The Polygon Containment Problem,“ Advances of Computing Research, Volume 1, pp. 1–33. JAI Press, Inc.
D. Kirkpatrick, “Efficient Computation of Continuous Skeletons,“ 20th Annual Symposium on Foundations of Computer Science, 1979, pp. 18–27.
T. Lozano-Perez, M. Wesley, “An Algorithm for Planning Collision-Free Paths among Polyhedral Obstacles,“ CACM 22, pp. 560–570 (1979).
J. Nievergelt, F.P. Preparata, “Plane-Sweep Algorithms for Intersecting Geometric Figures,“ CACM 25(10), pp. 739–747 (1982).
C. O'Dúnlaing, M.Sharir, C.K. Yap, “Retraction: a New Approach to Motion Planning,“ 15th Symposium on Theory of Computing, 1983, pp. 207–220.
C. O'Dúnlaing, M.Sharir, C.K. Yap, “Generalized Voronoi Diagrams for a Ladder: I. Topological Analysis,“ Technical Report 139, Courant Institute of Mathematical Sciences, Nov 1984.
C. O'Dúnlaing, M.Sharir, C.K. Yap, “Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram,“ Technical Report 140, Courant Institute of Mathematical Sciences, Nov 1984.
M.I. Shamos, “Geometric Complexity,“ Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, 1975, pp. 224–233.
C.K. Yap, “An O (nlog n) Algorithm for the Voronoi Diagram of Simple Curve Segments,“ manuscript, Courant Institue of Mathematical Sciences, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fortune, S.J. (1985). A fast algorithm for polygon containment by translation. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015744
Download citation
DOI: https://doi.org/10.1007/BFb0015744
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive