A fast algorithm for computing sparse visibility graphs (Q1262133): Difference between revisions

The authors present an O(\(| E| \log^ 2n)\)-time algorithm for constructing the visibility graph of a set of n nonintersecting line segments. Here \(| E|\) stands for the number of edges in the visibility graph. The algorithm may be inefficient for dense visibility graphs but it is faster than some previously published algorithms [\textit{E. Welzl}, Inf. Process. Lett. 20, 167-171 (1985; Zbl 0573.68036) and \textit{T. Asano}, \textit{L. Guibas}, \textit{J. Hershberger} and \textit{H. Imai}, Algoritmica 1, 49-63 (1986; Zbl 0611.68062)] on sparse visibility graphs.