A fast algorithm for computing sparse visibility graphs (Q1262133): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Visibility of disjoint polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maintenance of configurations in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01840385 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067947381 / rank | |||
Normal rank | |||
Latest revision as of 08:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for computing sparse visibility graphs |
scientific article |
Statements
A fast algorithm for computing sparse visibility graphs (English)
0 references
1990
0 references
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.
0 references
computational geometry
0 references
visibility graph construction
0 references
