A robust algorithm for finding the real intersections of three quadric surfaces

doi:10.1016/j.cagd.2005.02.001

Computer Aided Geometric Design

Volume 22, Issue 6, September 2005, Pages 515-530

https://doi.org/10.1016/j.cagd.2005.02.001 Get rights and content

Abstract

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.

References (17)

J.R. Miller et al.
Geometric algorithms for detecting and calculating all conics sections in the intersection of any two natural quadric surfaces
Graph. Models Image Process.
(1995)
I. Wilf et al.
Quadric surface intersection: shape and structure
Computer-Aided Design
(1993)
R.F. Sarraga
Algebraic methods for intersections of quadric surfaces in GMSOLID
Comp. Vision Graph. Image Process.
(1983)
W. Wang et al.
Computing quadric surface intersections based on an analysis of plane cubic curves
Graphical Models
(2002)
W. Wang et al.
Enhancing Levin's method for computing quadric-surface intersections
Computer Aided Geometric Design
(2003)
L. Yang
Recent advances on determining the number of real roots of parametric polynomials
J. Symbolic Comput.
(1999)
D. Cox et al.
Ideals, Varieties, and Algorithms
(1992)
E. Chionh et al.
Using multivariate resultants to find intersection of three quadric surfaces
ACM Trans. Graph.
(1991)

There are more references available in the full text version of this article.

Cited by (9)

Computing minimum distance between two implicit algebraic surfaces
2006, CAD Computer Aided Design
The minimum distance computation problem between two surfaces is very important in many applications such as robotics, CAD/CAM and computer graphics. Given two implicit algebraic surfaces, a new method based on the offset technique is presented to compute the minimum distance and a pair of points where the minimum distance occurs. The new method also works where there are an implicit algebraic surface and a parametric surface. Quadric surfaces, tori and canal surfaces are used to demonstrate our new method. When the two surfaces are a general quadric surface and a surface which is a cylinder, a cone or an elliptic paraboloid, the new method can produce two bivariate equations where the degrees are lower than those of any existing method.
Biparted Hyperboloid and Sphere Intersection Algorithm
2022, ACM International Conference Proceeding Series
Point Cloud Registration Using Virtual Interest Points from Macaulay’s Resultant of Quadric Surfaces
2021, Journal of Mathematical Imaging and Vision
Point cloud registration with virtual interest points from implicit quadric surface intersections
2018, Proceedings - 2017 International Conference on 3D Vision, 3DV 2017
Efficient Intersection of Three Quadrics and Applications in Computer Vision
2016, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Hand-eye calibration of SCARA robots using dual quaternions
2016, Pattern Recognition and Image Analysis

View all citing articles on Scopus

^☆: Project supported by The National Natural Science Foundation (10401021) and Postdoctoral Science Foundation of China.

View full text

A robust algorithm for finding the real intersections of three quadric surfaces☆

Abstract

Graph. Models Image Process.

Computer-Aided Design

Comp. Vision Graph. Image Process.

Graphical Models

Computer Aided Geometric Design

J. Symbolic Comput.

Ideals, Varieties, and Algorithms

Using multivariate resultants to find intersection of three quadric surfaces

ACM Trans. Graph.