Advertisement

Stabbing parallel segments with a convex polygon

Extended abstract
  • Michael T. Goodrich
  • Jack Scott Snoeyink
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)

Abstract

We present an algorithm that, given a set of n parallel line segments in the plane, finds a convex polygon whose boundary intersects each segment at least once, or determines that none exists. Our algorithm runs in O(n log n) steps and linear space, which is optimal. Our solution involves a reduction to a bipartite stabbing problem, using a “point-sweeping” or “chain-unwrapping” technique. We use geometric duality to solve bipartite stabbing.

Keywords

Line Segment Convex Polygon Left Endpoint Vertical Line Segment Parallel Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Atallah and C. Bajaj, Efficient algorithms for common transversals, Information Processing Letters, 25 (2), 6 May 1987, 87–90.CrossRefGoogle Scholar
  2. [2]
    M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th ACM Symp, on Theory Comput., Boston, 1983, 80–86.Google Scholar
  3. [3]
    H. Edelsbrunner, H.A. Maurer, F.P. Preparata, A.L. Rosenberg, E. Welzl, and D. Wood, Stabbing line segments, BIT, 22, 1982, 274–281.Google Scholar
  4. [4]
    H. Edelsbrunner, Finding transversals for sets of simple geometric figures, Theoretical Comp. Sci., 35, 1985, 55–69.Google Scholar
  5. [5]
    M.T. Goodrich and J.S. Snoeyink, Stabbing parallel segments with a convex polygon, submitted to Computer Vision, Graphics and Image Proc. Google Scholar
  6. [6]
    B. Grünbaum, On common transversals, Arch. Math. 9, 1958, 465–469.Google Scholar
  7. [7]
    M. Katchalski, T. Lewis, and A. Liu, Geometric permutations and common transversals, Disc. & Computational Geom., 1, 1986, 371–377.Google Scholar
  8. [8]
    J. O'Rourke, Computational Geometry Column #3, Computer Graphics 21 (5), October 1987, 314–315.Google Scholar
  9. [9]
    T. Pavlidis, A Vectorizer and Feature Extractor for Document Recognition, Comput. Vision, Graphics, Image Process 35, 1986, 111–127.Google Scholar
  10. [10]
    F.P. Preparata, and M.I. Shamos, Computational Geometry, Springer Verlag, New York, 1985.Google Scholar
  11. [11]
    F.P. Preparata, An optimal real time algorithm for planar convex hulls, Comm. ACM, 22(7), July 1979, 402–405.Google Scholar
  12. [12]
    M.I. Shamos, and D. Hoey, Geometric intersection problems, Proc. 17th IEEE Symp. on Foundations of Computer Science, Houston, 1976, 208–215.Google Scholar
  13. [13]
    J. Stolfi, Oriented projective geometry, Proc. of the 3rd ACM Symp. on Computational Geometry, Waterloo, 1987, 76–85.Google Scholar
  14. [14]
    A. Tamir, Problem 4-2 (New York University, Dept. of Statistics and Operations Research), Problems Presented at the Fourth NYU Computational Geometry Day (3/13/87).Google Scholar
  15. [15]
    M.R. Ward, L. Rossol, and S.W. Holland, CONSIGHT: An Adaptive Robot with Vision, Robotics Today, Summer 1979, 26–32.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Michael T. Goodrich
    • 1
  • Jack Scott Snoeyink
    • 2
  1. 1.Dept. of Computer ScienceThe Johns Hopkins UniversityUSA
  2. 2.Dept. of Computer ScienceStanford UniversityUSA

Personalised recommendations