Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments.

Farzad Hassanzadeh David Rappaport

Published in: WADS (2009)

Keyphrases

approximation algorithms
line segments
minimum cost
convex hull
set cover
np hard
circular arcs
special case
undirected graph
hough transform
straight line segments
randomized algorithms
vertex cover
spanning tree
facility location problem
constant factor
upper bound
open shop