An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem (Q2817863)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6622031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem |
scientific article; zbMATH DE number 6622031 |
Statements
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem (English)
0 references
2 September 2016
0 references
computational geometry
0 references
visibility
0 references
randomized algorithm
0 references
approximation algorithm
0 references
graph theory
0 references
0.9259215
0 references
0.8795934
0 references
0.85249007
0 references
0.85134244
0 references
0.84909856
0 references
0.8474779
0 references
