Advertisement

A fast algorithm for polygon containment by translation

  • S. J. Fortune
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 194)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. [AHU]
    A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1975.Google Scholar
  2. [B]
    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).Google Scholar
  3. [BFM]
    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.Google Scholar
  4. [BO]
    J.L. Bentley, T.A. Ottmann, “Algorithms for Reporting and Counting Geometric Intersections”, IEEE Transactions on Computers, C-28, pp. 643–647, (1979).Google Scholar
  5. [C]
    B. Chazelle, “The Polygon Containment Problem,“ Advances of Computing Research, Volume 1, pp. 1–33. JAI Press, Inc.Google Scholar
  6. [K]
    D. Kirkpatrick, “Efficient Computation of Continuous Skeletons,“ 20th Annual Symposium on Foundations of Computer Science, 1979, pp. 18–27.Google Scholar
  7. [LPW]
    T. Lozano-Perez, M. Wesley, “An Algorithm for Planning Collision-Free Paths among Polyhedral Obstacles,“ CACM 22, pp. 560–570 (1979).Google Scholar
  8. [NP]
    J. Nievergelt, F.P. Preparata, “Plane-Sweep Algorithms for Intersecting Geometric Figures,“ CACM 25(10), pp. 739–747 (1982).Google Scholar
  9. [OSY1]
    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.Google Scholar
  10. [OSY2]
    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.Google Scholar
  11. [OSY3]
    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.Google Scholar
  12. [S]
    M.I. Shamos, “Geometric Complexity,“ Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, 1975, pp. 224–233.Google Scholar
  13. [Y]
    C.K. Yap, “An O (nlog n) Algorithm for the Voronoi Diagram of Simple Curve Segments,“ manuscript, Courant Institue of Mathematical Sciences, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • S. J. Fortune
    • 1
  1. 1.AT & T Bell LaboratoriesMurray Hill

Personalised recommendations