Concepedia

Constructing the visibility graph for n-line segments in O(n2) time

Emo Welzl

Information Processing Letters · 1985 · 296 citations · 6 references

DOI

Concepts

References

6

A note on two problems in connexion with graphs

E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations

, , +6

An algorithm for planning collision-free paths among polyhedral obstacles

Tomás Lozano‐Pérez, M. A. Wesley · Communications of the ACM · 1979 · 2.3K citations

, , +9

Euclidean shortest paths in the presence of rectilinear barriers

D. T. Lee, F. P. Preparata · Networks · 1984 · 389 citations

, , +15

Proximity and reachability in the plane.

Der-Tsai Lee · Defense Technical Information Center (DTIC) · 1978 · 132 citations

, , +11

The power of geometric duality

Bernard Chazelle, Leo J. Guibas, D. T. Lee · 1983 · 71 citations

, , +9