Planar visibility, testing and counting

DOI10.1145/1810959.1810973MaRDI QIDQ5405865zbMATH OpenOpenAlexFDO

Authors Joachim Gudmundsson, Pat Morin

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

zbMATH Keywords

geometric data structuresvisibility

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Visibility testing and counting
• Visibility testing and counting
• An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
• Randomized approximation algorithms for planar visibility counting problem
• Visibility testing and counting for uncertain segments

Cited in

(10)

• Randomized approximation algorithms for planar visibility counting problem
• Visibility testing and counting
• Weak visibility counting in simple polygons
• Visibility testing and counting for uncertain segments
• An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
• Visibility testing and counting
• \(\alpha\)-visibility
• The Expected Number of 3D Visibility Events Is Linear
• Minimizing visible edges in polyhedra
• Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles

This page was built for publication: Planar visibility, testing and counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405865)