Efficient computation of query point visibility in polygons with holes

DOI10.1145/1064092.1064140zbMath1380.68408OpenAlexW2010226110MaRDI QIDQ5370627

Mohammad Ghodsi, Alireza Zarei

Publication date: 20 October 2017

Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1064092.1064140

zbMATH Keywords

visibility polygonpolygon with holesvisibility decomposition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (6)

Visibility queries in a polygonal region ⋮ Space–Query-Time Tradeoff for Computing the Visibility Polygon ⋮ Randomized approximation algorithms for planar visibility counting problem ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane ⋮ Visibility testing and counting

This page was built for publication: Efficient computation of query point visibility in polygons with holes