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

Information Processing Letters

Volumn 20, Issue 4, 1985, Pages 167-171

  Welzl, Emo ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Computational geometry; shortest path; visibility graph

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

COMPUTATIONAL GEOMETRY; N-LINE SEGMENTS; VISIBILITY GRAPH;

MATHEMATICAL TECHNIQUES;

EID: 0022059930     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(85)90044-4     Document Type: Article

References (9)

1. The power of geometric duality
2. A note on two problems in connection with graphs
3. Constructing arrangements of lines and hyperplanes with applications
4. Graphics in flatland: A case study
5. Proximity and reachability in the plane
6. Euclidean shortest paths in the presence of rectilinear barriers
7. An algorithm for planning collision—free paths among polyhedral obstacles
8. On the shortest path in polyhedral spaces