Intersection algorithms for lines and circles

DOI10.1145/49155.49157MaRDI QIDQ4205001zbMATH OpenOpenAlexFDO

Authors A. E. Middleditch, T. W. Stacey, S. B. Tor

Publication date 1989

Published in ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/49155.49157

zbMATH Keywords

computational geometrycomputer arithmeticcomputer graphicscomputer-aided engineeringdegenerate geometrygeometric algorithmsgeometric constructionsintersection algorithms for lines and circles

Mathematics Subject Classification ID

Descriptive geometry (51N05) Algorithms for approximation of functions (65D15) Interval and finite arithmetic (65G30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Robust computation of tangent lines and circles
• scientific article; zbMATH DE number 4078610
• Corrigenda: intersection algorithms for lines and circles
• scientific article; zbMATH DE number 871086
• scientific article; zbMATH DE number 4080990

Cited in

(12)

• Robust computation of tangent lines and circles
• Test for intersection between circle and rectangle
• Algorithms for crossover point determination
• Efficient algorithms for line and curve segment intersection using restricted predicates
• Intersections and circuits in sets of line segments
• scientific article; zbMATH DE number 4126555 (Why is no real title available?)
• Corrigenda: intersection algorithms for lines and circles
• EXACT ALGORITHMS FOR CIRCLES ON THE SPHERE
• An adaptive moments-based interface reconstruction using intersection of the cell with one half-plane, two half-planes and a circle
• Optimal contractor for n-gons constraint
• Geometric algorithms for finding a point in the intersection of balls
• Intersections of lines and circles

This page was built for publication: Intersection algorithms for lines and circles

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