Visibility testing and counting

DOI10.1016/j.ipl.2015.03.009zbMath1329.68257OpenAlexW2525477186MaRDI QIDQ2346552

Alireza Zarei, Maryam Pourreza, Mohammad Ghodsi, Sharareh Alipour

Publication date: 2 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.03.009

zbMATH Keywords

approximation algorithmrandomized algorithmvisibilitycomputational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Visibility testing and counting for uncertain segments ⋮ Continuous visible query for three-dimensional objects in spatial databases

Cites Work

• Visibility queries and maintenance in simple polygons
• Efficient visibility queries in simple polygons
• Space/query-time tradeoff for computing the visibility polygon
• Visibility and Ray Shooting Queries in Polygonal Domains
• Visibility Testing and Counting
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Graphics in flatland revisited
• The visibility diagram: A data structure for visibility problems and motion planning
• Efficient computation of query point visibility in polygons with holes
• Planar visibility
• Visibility Algorithms in the Plane
• THE VISIBILITY COMPLEX

This page was built for publication: Visibility testing and counting