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
Polyhedral modelling with exact arithmetic
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Computer Aided Geometric Design
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
The virtual mesh: a geometric abstraction for efficiently computing radiosity
ACM Transactions on Graphics (TOG)
ESOLID---A System for Exact Boundary Evaluation
Proceedings of the seventh ACM symposium on Solid modeling and applications
Interval Methods in Geometric Modeling
GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Efficient solution of rational conics
Mathematics of Computation
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
Intersecting quadrics: an efficient and exact implementation
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
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
Intersecting quadrics: an efficient and exact implementation
Computational Geometry: Theory and Applications
A robust algorithm for finding the real intersections of three quadric surfaces
Computer Aided Geometric Design
Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm
Journal of Symbolic Computation
Real algebraic numbers and polynomial systems of small degree
Theoretical Computer Science
Using signature sequences to classify intersection curves of two quadrics
Computer Aided Geometric Design
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
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
A robust algorithm for finding the real intersections of three quadric surfaces
Computer Aided Geometric Design
Computing minimum distance between two implicit algebraic surfaces
Computer-Aided Design
Real solving of bivariate polynomial systems
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Robustly computing intersection curves of two canal surfaces with quadric decomposition
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Approximating algebraic space curves by circular arcs
Proceedings of the 7th international conference on Curves and Surfaces
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
In this paper, we present the first exact, robust and practical method for computing an explicit representation of the intersection of two arbitrary quadrics whose coefficients are rational. Combining results from the theory of quadratic forms, linear algebra and number theory, we show how to obtain parametric intersection curves that are near-optimal in the number and depth of radicals involved.