scientific article; zbMATH DE number 6846375

DOI10.4230/LIPICS.ESA.2016.4MaRDI QIDQ4606269zbMATHFDO

Authors Mikkel Abrahamsen, Bartosz Walczak

Publication date 2 March 2018

zbMATH Keywords

optimal algorithmsimple polygonconstant workspacecommon tangent

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 3848644
• scientific article; zbMATH DE number 4045150
• scientific article; zbMATH DE number 17632
• On the complexity of convex hulls of subsets of the two-dimensional plane
• Optimal computation of finitely oriented convex hulls
• Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
• LATIN 2004: Theoretical Informatics
• The complexity of incremental convex hull algorithms in \(R^ d\)
• A Nearly-Linear Bound for Chasing Nested Convex Bodies

Cited in

(3)

• An optimal algorithm for the separating common tangents of two polygons
• A Nearly-Linear Bound for Chasing Nested Convex Bodies
• Common tangents of two disjoint polygons in linear time and constant workspace

This page was built for publication:

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