Intersection algorithms for lines and circles
暂无分享,去创建一个
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.
[1] L. Carpenter. Review of "Geometric principles and procedures for computer graphic applications" by Sylvan H. Chasen. Prentice Hall 1978. , 1980, COMG.
[2] Sylvan H. Chasen,et al. Geometric Principles and Procedures for Computer Graphic Applications , 1978 .
[3] David F. Rogers,et al. Interactive graphics and numerical control , 1980 .
[4] M. Sabin. The use of piecewise forms for the numerical representation of shape , 1976 .