An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
From MaRDI portal
Publication:2817863
DOI10.1007/978-3-319-42634-1_17zbMath1476.68265arXiv1605.03542OpenAlexW2365104617MaRDI QIDQ2817863
Mohammad Ghodsi, Sharareh Alipour, A. H. Jafari
Publication date: 2 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.03542
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Visibility queries and maintenance in simple polygons
- Efficient visibility queries in simple polygons
- Space/query-time tradeoff for computing the visibility polygon
- Query point visibility computation in polygons with holes
- Visibility Testing and Counting
- Optimal Search in Planar Subdivisions
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Planar visibility
- Visibility Algorithms in the Plane
- THE VISIBILITY COMPLEX
This page was built for publication: An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem