Stabbing Line Segments with Disks: Complexity and Approximation Algorithms.
Konstantin KobylkinPublished in: AIST (2017)
Keyphrases
- approximation algorithms
- line segments
- worst case
- np hardness
- np hard
- hough transform
- special case
- straight line
- ellipse detection
- vertex cover
- facility location problem
- digital pictures
- minimum cost
- set cover
- approximation ratio
- straight line segments
- randomized algorithms
- aerial images
- primal dual
- open shop
- computational complexity
- upper bound
- constant factor
- disjoint paths
- intersection points
- greedy algorithm
- polynomial time approximation
- approximation schemes
- network design problem
- vanishing points
- undirected graph
- perspective images
- branch and bound algorithm