Outer common tangents and nesting of convex hulls in linear time and constant workspace

Mikkel Abrahamsen, Bartosz Walczak

1 Citation (Scopus)
12 Downloads (Pure)

Abstract

We describe the first algorithm to compute the outer common tangents of two disjoint simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies on the same side of the line. An outer common tangent of two polygons is a tangent of both polygons such that the polygons lie on the same side of the tangent. Each polygon is given as a read-only array of its corners in cyclic order. The algorithm detects if an outer common tangent does not exist, which is the case if and only if the convex hull of one of the polygons is contained in the convex hull of the other. Otherwise, two corners defining an outer common tangent are returned.

Original languageEnglish
Title of host publication24th Annual European Symposium on Algorithms (ESA 2016)
EditorsPiotr Sankowski, Christos Zaroliagis
Number of pages15
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication date1 Aug 2016
Article number4
ISBN (Electronic)978-3-95977-015-6
DOIs
Publication statusPublished - 1 Aug 2016
Event24th Annual European Symposium on Algorithms - Århus, Denmark
Duration: 22 Aug 201626 Aug 2016
Conference number: 24

Conference

Conference24th Annual European Symposium on Algorithms
Number24
Country/TerritoryDenmark
CityÅrhus
Period22/08/201626/08/2016
SeriesLeibniz International Proceedings in Informatics
Volume57
ISSN1868-8969

Fingerprint

Dive into the research topics of 'Outer common tangents and nesting of convex hulls in linear time and constant workspace'. Together they form a unique fingerprint.

Cite this