Computing common tangents without a separating line

DOI10.1007/3-540-60220-8_61MaRDI QIDQ5057432zbMATH OpenOpenAlexFDO

Authors Jack Snoeyink, David Kirkpatrick

Publication date 16 December 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60220-8_61

Mathematics Subject Classification ID

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

Recommendations

• Common tangents and common transversals
• Common tangents to planar parametric curves: A geometric solution
• An optimal algorithm for the separating common tangents of two polygons
• Common tangents of two disjoint polygons in linear time and constant workspace
• Estimating Tangent and Normal Cones Without Calculus

Cites work

• COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
• Computing the extreme distances between two convex polygons
• scientific article; zbMATH DE number 49092 (Why is no real title available?)
• scientific article; zbMATH DE number 51258 (Why is no real title available?)
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• Implicitly representing arrangements of lines or segments
• Maintenance of configurations in the plane
• Visibility and intersection problems in plane geometry

Cited in

(4)

• Optimizing generalized kernels of polygons
• Self-approaching paths in simple polygons
• Common tangents of two disjoint polygons in linear time and constant workspace
• An optimal algorithm for the separating common tangents of two polygons

This page was built for publication: Computing common tangents without a separating line

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