Visibility testing and counting

DOI10.1016/J.IPL.2015.03.009zbMATH Open1329.68257OpenAlexW2525477186MaRDI QIDQ2346552FDOQ2346552

Authors: Sharareh Alipour, Mohammad Ghodsi, Alireza Zarei, Maryam Pourreza 

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

Recommendations

• Visibility testing and counting
• Planar 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

zbMATH Keywords

randomized algorithmapproximation algorithmcomputational geometryvisibility

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Continuous visible query for three-dimensional objects in spatial databases
• Randomized approximation algorithms for planar visibility counting problem
• Planar visibility, testing and counting
• Visibility testing and counting for uncertain segments
• Visibility testing and counting

This page was built for publication: Visibility testing and counting

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