Intersection algorithms for lines and circles

Authors:
A. E. Middleditch;T. W. Stacey;S. B. Tor
Affiliations:
Brunel Univ, Uxbridge, UK;Polytechnic of Central London, London, UK;Hewlett Packard Asia, Ltd., Singapore
Venue:
ACM Transactions on Graphics (TOG)
Year:
1988

Citing 1
Cited 5

Geometric Principles and Procedures for Computer Graphic Applications

Geometric Principles and Procedures for Computer Graphic Applications

Complex Gaussian integers for “Gaussian graphics”

ACM SIGPLAN Notices
Corrigenda: intersection algorithms for lines and circles

ACM Transactions on Graphics (TOG)
Construction of a non-symmetric geometric buffer from a set of line segments

Computers & Geosciences
Triangulations with locally optimal Steiner points

SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Computing 2d robot workspace in parallel with CUDA

SIMPAR'12 Proceedings of the Third international conference on Simulation, Modeling, and Programming for Autonomous Robots

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a unified representation scheme for the implicit equations of points, lines, and circles. An associated set of geometric algorithms operates successfully on degenerate and nearly degenerate geometry, and when necessary produces degenerate geometric results. Computation errors are interpreted geometrically in order to establish preconditions for reliable results and requirements on the resolution of computer arithmetic. The algorithms thus provide a basis for the wide range of geometric constructions required by computer-aided drafting and design systems.