Randomized approximation algorithms for planar visibility counting problem

DOI10.1016/J.TCS.2017.10.009MaRDI QIDQ1685962zbMATH OpenOpenAlexFDO

Authors Sharareh Alipour, Mohammad Ghodsi, Amir Jafari

Publication date 20 December 2017

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2017.10.009

zbMATH Keywords

graph theoryrandomized algorithmapproximation algorithmcomputational geometryvisibility

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
• Visibility testing and counting
• Visibility testing and counting
• Planar visibility, testing and counting
• Weak visibility counting in simple polygons

Cites work

• An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Efficient computation of query point visibility in polygons with holes
• Efficient visibility queries in simple polygons
• Graphics in flatland revisited
• Optimal Search in Planar Subdivisions
• Planar visibility, testing and counting
• Space/query-time tradeoff for computing the visibility polygon
• THE VISIBILITY COMPLEX
• The visibility diagram: A data structure for visibility problems and motion planning
• Visibility Algorithms in the Plane
• Visibility queries and maintenance in simple polygons
• Visibility testing and counting

Cited in

(7)

• Region-based approximation algorithms for visibility between imprecise locations
• Planar visibility, testing and counting
• Visibility testing and counting
• Visibility testing and counting for uncertain segments
• Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
• Visibility testing and counting
• An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem

This page was built for publication: Randomized approximation algorithms for planar visibility counting problem

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