Geometric approaches to nonplanar quadric surface intersection curves
ACM Transactions on Graphics (TOG)
Analysis of Quadric-Surface-Based Solid Models
IEEE Computer Graphics and Applications
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Using multivariate resultants to find the intersection of three quadric surfaces
ACM Transactions on Graphics (TOG)
Graphical Models and Image Processing
Recent advances on determining the number of real roots of parametric polynomials
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
Communications of the ACM
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Near-optimal parameterization of the intersection of quadrics
Proceedings of the nineteenth annual symposium on Computational geometry
Enhancing Levin's method for computing quadric-surface intersections
Computer Aided Geometric Design
Hi-index | 0.00 |
By Bezout's theorem, three quadric surfaces have at most eight isolated intersections although they may have infinitely many intersections. In this paper, we present an efficient and robust algorithm, to obtain the isolated and the connected components of, or to determine the number of isolated real intersections of, three quadric surfaces by reducing the problem to computing the real intersections of two planar curves obtained by Levin's method.