Recognizing an envelope of lines in linear time

  • Eric Guévremont
  • Jack Snoeyink
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)


The envelope polygon of a set of lines, L, is the polygon consisting of the finite length segments that bound the infinite faces of the arrangement A(L). Given an envelope polygon, we show how to sort its edges by slope in linear time. Using this result, we can determine whether a given polygon P is an envelope in linear time.


Convex Hull Linear Time Simple Polygon Information Processing Letter Polygonal Region 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Marshall Bern, David Eppstein, Paul Plassmann, and Francis Yao. Horizon theorems for lines and polygons. In Jacob E. Goodman, Richard Pollack, and William Steiger, editors, Discrete and Computational Geometry: Papers from the DIMACS Special Year, pages 45–66. American Mathematical Society, Providence, RI, 1991.Google Scholar
  2. [2]
    Bernard Chazelle. Triangulating a simple polygon in linear time. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 220–230, 1990.Google Scholar
  3. [3]
    Y. T. Ching and D. T. Lee. Finding the diameter of a set of lines. Pattern Recognition Letters, 18:249–255, 1985.Google Scholar
  4. [4]
    R. Cole, J. Salowe, W. Steiger, E. Szemerédi An optimal-time algorithm for slope selection SIAM J. Comp. 18(4), pages 792–810, 1989.CrossRefGoogle Scholar
  5. [5]
    Herbert Edelsbrunner and Leonidas J. Guibas. Topologically sweeping an arrangement. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 389–403, 1986.Google Scholar
  6. [6]
    D. Eu, E. Guévremont, and G. T. Toussaint. On classes of arrangements of lines. Accepted to the Fourth Canadian Conference on Computational Geometry, 1992.Google Scholar
  7. [7]
    R. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132–133, 1972.CrossRefGoogle Scholar
  8. [8]
    R. L. Graham and F. F. Yao. Finding the convex hull of a simple polygon. Journal of Algorithms, 4:324–331, 1983.CrossRefGoogle Scholar
  9. [9]
    Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan. Sorting Jordan sequences in linear time. In Proceedings of the ACM Symposium on Computational Geometry, pages 196–203, 1985.Google Scholar
  10. [10]
    M. Keil. A simple algorithm for determining the envelope of a set of lines. Information Processing Letters, 39:121–124, 1991.CrossRefGoogle Scholar
  11. [11]
    G. T. Toussaint and D. Avis. On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition, 15(1):23–29, 1982.CrossRefGoogle Scholar
  12. [12]
    G. Vegter. Computing the bounded region determined by finitely many lines in the plane. Technical Report 87-03, Rijksuniversiteit Groningen, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Eric Guévremont
    • 1
  • Jack Snoeyink
    • 2
  1. 1.School of Computer ScienceMcGill UniversityUSA
  2. 2.Department of Computer ScienceUniversity of British ColumbiaUSA

Personalised recommendations