Computing the full visibility graph of a set of line segments

DOI10.1016/0020-0190(92)90033-RzbMath0772.68109OpenAlexW2090581029MaRDI QIDQ1198072

Stephen K. Wismath

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90033-r

zbMATH Keywords

visibility graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Link distance and shortest path problems in the plane ⋮ Disproving a conjecture on planar visibility graphs ⋮ VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME

Cites Work

• Unnamed Item
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• A unified approach to visibility representations of planar graphs
• Visibility of disjoint polygons
• Shortest path solves edge-to-edge visibility in a polygon
• An Output-Sensitive Algorithm for Computing Visibility Graphs

This page was built for publication: Computing the full visibility graph of a set of line segments