Planar visibility
From MaRDI portal
Publication:5405865
DOI10.1145/1810959.1810973zbMath1284.68212OpenAlexW2015441057MaRDI QIDQ5405865
Pat Morin, Joachim Gudmundsson
Publication date: 3 April 2014
Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1810959.1810973
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Combinatorial complexity of geometric structures (52C45)
Related Items (8)
Randomized approximation algorithms for planar visibility counting problem ⋮ Visibility testing and counting for uncertain segments ⋮ Minimizing visible edges in polyhedra ⋮ Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles ⋮ Visibility Testing and Counting ⋮ An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem ⋮ Visibility testing and counting ⋮ Weak visibility counting in simple polygons
This page was built for publication: Planar visibility
