An optimal algorithm for the separating common tangents of two polygons

DOI10.4230/LIPICS.SOCG.2015.198MaRDI QIDQ5368688zbMATH OpenFDO

Authors Mikkel Abrahamsen

Publication date 10 October 2017

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

zbMATH Keywords

common tangentconstant workspaceoptimal algorithmplanar computational geometrysimple polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Common tangents of two disjoint polygons in linear time and constant workspace
• scientific article; zbMATH DE number 6846375
• Computing common tangents without a separating line
• An optimal algorithm for finding the separation of simple polygons
• Parallel algorithms for some functions of two convex polygons

Cited in

(4)

• Optimizing a Strip Separating Two Polygons
• Common tangents of two disjoint polygons in linear time and constant workspace
• Computing common tangents without a separating line
• Constant workspace algorithms for computing relative hulls in the plane

This page was built for publication: An optimal algorithm for the separating common tangents of two polygons

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