Computing Smallest Convex Intersecting Polygons

Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak (Corresponding author), Antonis Skarlatos

Research output: Contribution to journalArticleAcademic

80 Downloads (Pure)

Abstract

A polygon C is an intersecting polygon for a set O of objects in the plane 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.
Original languageEnglish
Article number2208.07567
Number of pages28
JournalarXiv
Volume2022
DOIs
Publication statusPublished - 16 Aug 2022

Fingerprint

Dive into the research topics of 'Computing Smallest Convex Intersecting Polygons'. Together they form a unique fingerprint.

Cite this