Recognizing an envelope of lines in linear time
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.
KeywordsConvex Hull Linear Time Simple Polygon Information Processing Letter Polygonal Region
Unable to display preview. Download preview PDF.
- 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
- 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
- Y. T. Ching and D. T. Lee. Finding the diameter of a set of lines. Pattern Recognition Letters, 18:249–255, 1985.Google Scholar
- 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
- 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
- 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
- G. Vegter. Computing the bounded region determined by finitely many lines in the plane. Technical Report 87-03, Rijksuniversiteit Groningen, 1987.Google Scholar