Minimum-Perimeter Intersecting Polygons

Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computing a minimum-perimeter intersecting polygon of a given set of n segments in the plane was first considered by Rappaport in 1995. This problem is not known to be polynomial, nor it is known to be NP-hard. Rappaport (1995) gave an exponential-time exact algorithm for MPIP. Hassanzadeh and Rappaport (2009) gave a polynomial-time approximation algorithm with ratio π

• Type: Conference
• Year: 2010
• Where: LATIN
• Authors: Adrian Dumitrescu, Minghui Jiang
• Keywords: Information Retrieval, Intersecting Polygon, LATIN 2010, Minimum-perimeter Intersecting Polygon, Rappaport