Geometric approaches to nonplanar quadric surface intersection curves
ACM Transactions on Graphics (TOG)
Automatic parsing of degenerate quadric-surface intersections
ACM Transactions on Graphics (TOG)
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
On the lower degree intersections of two natural quadrics
ACM Transactions on Graphics (TOG)
Graphical Models and Image Processing
Parametrization of algebraic curves over optimal field extensions
Journal of Symbolic Computation - Special issue: parametric algebraic curves and applications
Algorithms for rational real algebraic curves
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces
Communications of the ACM
Points on Algebraic Curves and the Parametrization Problem
Selected Papers from the International Workshop on Automated Deduction in Geometry
Near-optimal parameterization of the intersection of quadrics
Proceedings of the nineteenth annual symposium on Computational geometry
Classifying the Nonsingular Intersection Curve of Two Quadric Surfaces
GMP '02 Proceedings of the Geometric Modeling and Processing — Theory and Applications (GMP'02)
Enhancing Levin's method for computing quadric-surface intersections
Computer Aided Geometric Design
Efficient isolation of polynomial's real roots
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
On the computation of an arrangement of quadrics in 3D
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Intersecting quadrics: an efficient and exact implementation
Computational Geometry: Theory and Applications
Using signature sequences to classify intersection curves of two quadrics
Computer Aided Geometric Design
Journal of Symbolic Computation
Topological classification of non-degenerate intersections of two ring tori
Computer Aided Geometric Design
Journal of Symbolic Computation
| Hi-index | 0.00 |
We present an exact and efficient algorithm for computing a proper parametric representation of the intersection of two quadrics in three-dimensional real space given by implicit equations with rational coefficients. The output functions parameterizing the intersection in projective space are polynomial, whenever it is possible, which is the case when the intersection is not a smooth quartic (for example, a singular quartic, a cubic and a line, and two conics). Furthermore, the parameterization is near-optimal in the sense that the number of distinct square roots appearing in the coefficients of these functions is minimal, except in a small number of well-identified cases where there may be an extra square root. In addition, the algorithm is practical: a complete and efficient C++ implementation is described in Lazard et al. [Lazard, S., Penaranda, L.M., Petitjean, S., 2006. Intersecting quadrics: An efficient and exact implementation. In: 20th ACM Symposium on Computational Geometry, 2004. Computational Geometry: Theory and Applications 35 (1-2), 74-99 (special issue)]. In Part I, we present an algorithm for computing a parameterization of the intersection of two arbitrary quadrics which we prove to be near-optimal in the generic, smooth quartic, case. Parts II and III treat the singular cases. We present in Part II the first classification of pencils of quadrics according to the real type of the intersection and we show how this classification can be used to efficiently determine the type of the real part of the intersection of two arbitrary quadrics. This classification is at the core of the design of our algorithms for computing near-optimal parameterizations of the real part of the intersection in all singular cases. We present these algorithms in Part III and give examples covering all the possible situations in terms of both the real type of intersection and the number and depth of square roots appearing in the coefficients.