Common tangents of two disjoint polygons in linear time and constant workspace

DOI10.1145/3284355zbMATH Open1454.68149arXiv1601.01816OpenAlexW2782758897WikidataQ128836260 ScholiaQ128836260MaRDI QIDQ4629982FDOQ4629982

Authors: Mikkel Abrahamsen, Bartosz Walczak 

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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 read-only 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 polygons---whether they are nested, overlapping, or disjoint---and our algorithm thus also decides this relationship.

Full work available at URL: https://arxiv.org/abs/1601.01816

Recommendations

• An optimal algorithm for the separating common tangents of two polygons
• scientific article; zbMATH DE number 6846375
• Computing common tangents without a separating line
• Parallel algorithms for some functions of two convex polygons
• Three problems about simple polygons

zbMATH Keywords

simple polygonconstant workspacecommon tangent

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cited In (3)

• Computing common tangents without a separating line
• Title not available (Why is that?)
• An optimal algorithm for the separating common tangents of two polygons

This page was built for publication: Common tangents of two disjoint polygons in linear time and constant workspace

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629982)