A robust algorithm for finding the real intersections of three quadric surfaces. (English summary) Comput. Aided Geom. Design 22 (2005), no. 6, 515–530. This paper deals with the problem of real intersections of three quadric surfaces in a truly practical approach. Basically the problem is reduced to the problem of finding real intersections of two planar curves which is eventually solved by a method due to J. Z. Levin. The authors discuss the problem thoroughly. They do not exclude the cases where an infinite number of points is contained in the intersection. The algorithm they end up with is described step by step. Thus the reader can easily implement the result. The authors claim that the whole procedure is significantly more stable than existing algorithms
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.