Fast Approximation Algorithms for Stabbing Special Families of Line Segments with Equal Disks.
Konstantin KobylkinPublished in: AIST (2020)
Keyphrases
- approximation algorithms
- line segments
- np hard
- hough transform
- special case
- straight line
- vertex cover
- minimum cost
- digital pictures
- open shop
- worst case
- facility location problem
- ellipse detection
- network design problem
- approximation ratio
- set cover
- approximation schemes
- circular arcs
- precedence constraints
- np hardness
- disjoint paths
- perspective images
- constant factor
- vanishing points
- randomized algorithms
- straight line segments
- image processing
- constant factor approximation
- aerial images
- computational complexity
- primal dual
- undirected graph
- linear programming
- optimal solution