Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments.
Anup JoshiN. S. NarayanaswamyPublished in: SWAT (2014)
Keyphrases
- approximation algorithms
- line segments
- special case
- hough transform
- np hard
- worst case
- facility location problem
- vertex cover
- straight line
- digital pictures
- primal dual
- minimum cost
- perspective images
- ellipse detection
- aerial images
- approximation ratio
- circular arcs
- constant factor
- set cover
- open shop
- network design problem
- straight line segments
- approximation guarantees
- randomized algorithms
- polynomial time approximation
- precedence constraints
- vanishing points
- markov chain
- np hardness
- image sequences
- vision system
- evolutionary algorithm