Computing the full visibility graph of a set of line segments
From MaRDI portal
Publication:1198072
DOI10.1016/0020-0190(92)90033-RzbMath0772.68109OpenAlexW2090581029MaRDI QIDQ1198072
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
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
This page was built for publication: Computing the full visibility graph of a set of line segments