Year: 2022
Type: article
Abstract: A polygon C is an intersecting polygon for a set O of objects in ℝ² if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the minimum-area convex intersecting polygon for a given set O of objects. We present an FPTAS for both problems for the case where O is a set of possibly intersecting convex polygons in the plane of total complexity n. Furthermore, we present an exact polynomial-time algorithm for the minimum-perimeter intersecting polygon for the case where O is a set of n possibly intersecting segments in the plane. So far, polynomial-time exact algorithms were only known for the minimum perimeter intersecting polygon of lines or of disjoint segments.
Parent work: LIPIcs, Volume 244, ESA 2022, Complete Volume
Authors: Antoniadis, Antonios, de Berg, Mark, Kisfaludi-Bak, Sándor, Skarlatos, Antonis
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G565383568, G725356751
OpenAlex ID: W4292219087
