Improved complexity bounds for center location problems on networks by using dynamic data structures
SIAM Journal on Discrete Mathematics
Stabbing parallel segments with a convex polygon
Computer Vision, Graphics, and Image Processing
Shortest polygonal paths in space
Computing
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Computing Shortest Transversals
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Farthest line segment Voronoi diagrams
Information Processing Letters
On intersecting a set of parallel line segments with a convex polygon of minimum area
Information Processing Letters
Approximating largest convex hulls for imprecise points
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Largest bounding box, smallest diameter, and related problems on imprecise points
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The maximal distance between imprecise point objects
Fuzzy Sets and Systems
Minimum perimeter convex hull of imprecise points in convex regions
Proceedings of the twenty-seventh annual symposium on Computational geometry
Minimum-perimeter intersecting polygons
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
Let S denote a set of line segments in the plane. We say that a polygon P intersects S if every segment in S has a non-empty intersection with the interior or boundary of P . Currently, the best known algorithm finding a minimum perimeter polygon intersecting a set of line segments has a worst case exponential running time. It is also still unknown whether this problem is NP-hard. In this note we explore several approximation algorithms. We present efficient approximation algorithms that yield good empirical results, but can perform very poorly on pathological examples. We also present an O(n logn ) algorithm with a guaranteed worst case performance bound that is at most *** /2 times that of the optimum.