Computing common tangents without a separating line

DOI10.1007/3-540-60220-8_61zbMath1502.68328OpenAlexW1817805145MaRDI QIDQ5057432

Jack Scott Snoeyink, David G. 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)

Related Items (2)

Self-approaching paths in simple polygons ⋮ Optimizing generalized kernels of polygons

Cites Work

• Visibility and intersection problems in plane geometry
• Maintenance of configurations in the plane
• Implicitly representing arrangements of lines or segments
• COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
• Computing the extreme distances between two convex polygons
• Unnamed Item
• Unnamed Item
• Unnamed Item

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