Common tangents of two disjoint polygons in linear time and constant workspace
Abstract
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a readonly array of its corners in cyclic order, the algorithm runs in linear time and constant workspace and is the first to achieve the two complexity bounds simultaneously. The set of common tangents provides basic information about the convex hulls of the polygonswhether they are nested, overlapping, or disjointand our algorithm thus also decides this relationship.
 Publication:

arXiv eprints
 Pub Date:
 January 2016
 DOI:
 10.48550/arXiv.1601.01816
 arXiv:
 arXiv:1601.01816
 Bibcode:
 2016arXiv160101816A
 Keywords:

 Computer Science  Computational Geometry;
 68U05;
 65D18;
 I.3.5
 EPrint:
 Final published version, merged with arXiv:1511.04036