Visibility Testing and Counting

DOI10.1007/978-3-642-21204-8_36zbMath1329.68258OpenAlexW1986162022MaRDI QIDQ3004687

Alireza Zarei, Sharareh Alipour

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_36

zbMATH Keywords

approximation algorithmvisibilitycomputational geometry

Mathematics Subject Classification ID

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

Related Items (5)

Randomized approximation algorithms for planar visibility counting problem ⋮ Visibility testing and counting for uncertain segments ⋮ An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem ⋮ Visibility testing and counting ⋮ Weak visibility counting in simple polygons

Cites Work

• Unnamed Item
• Efficient partition trees
• Visibility queries and maintenance in simple polygons
• Efficient visibility queries in simple polygons
• Query point visibility computation in polygons with holes
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Planar visibility
• Visibility Algorithms in the Plane
• THE VISIBILITY COMPLEX

This page was built for publication: Visibility Testing and Counting