2026-08-17T08:54:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6346 2024-03-06T10:38:02Z ddc:004 open_access

Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace Abrahamsen, Mikkel Walczak, Bartosz simple polygon common tangent optimal algorithm constant workspace 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mikkel Abrahamsen and Bartosz Walczak 2016 Is Part Of LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2016.4 urn:nbn:de:0030-drops-63465 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.4 eng https://creativecommons.org/licenses/by/3.0/legalcode