Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10335958 | Computer Aided Geometric Design | 2005 | 16 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Zhi-qiang Xu, Xiaoshen Wang, Xiao-diao Chen, Jia-guang Sun,