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

Mikkel Abrahamsen, Bartosz Walczak

1 Citationer (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.

OriginalsprogEngelsk
Titel24th Annual European Symposium on Algorithms (ESA 2016)
RedaktørerPiotr Sankowski, Christos Zaroliagis
Antal sider15
ForlagSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publikationsdato1 aug. 2016
Artikelnummer4
ISBN (Elektronisk)978-3-95977-015-6
DOI
StatusUdgivet - 1 aug. 2016
Begivenhed24th Annual European Symposium on Algorithms - Århus, Danmark
Varighed: 22 aug. 201626 aug. 2016
Konferencens nummer: 24

Konference

Konference24th Annual European Symposium on Algorithms
Nummer24
Land/OmrådeDanmark
ByÅrhus
Periode22/08/201626/08/2016
NavnLeibniz International Proceedings in Informatics
Vol/bind57
ISSN1868-8969

Fingeraftryk

Dyk ned i forskningsemnerne om 'Outer common tangents and nesting of convex hulls in linear time and constant workspace'. Sammen danner de et unikt fingeraftryk.

Citationsformater