A new algorithm for computing visibility graphs of polygonal obstacles in the plane
From MaRDI portal
Publication:2970428
DOI10.20382/jocg.v6i1a14zbMath1405.68409OpenAlexW2252238546MaRDI QIDQ2970428
Publication date: 30 March 2017
Full work available at URL: https://doaj.org/article/83ae71cdf1754c2d838667b17b0f2432
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane ⋮ Computing Shortest Paths in the Plane with Removable Obstacles
This page was built for publication: A new algorithm for computing visibility graphs of polygonal obstacles in the plane
