Abstract
We are interested in efficiently and robustly computing a parametric form of the intersection of two implicit quadrics with rational coefficients. Our method is similar in spirit to the general method introduced by J. Levin for computing an explicit representation of the intersection of two quadrics, but extends it in several directions. Combining results from the theory of quadratic forms, a projective formalism and new theorems characterizing the intersection of two quadratic surfaces, we show how to obtain parametric representations that are both “simple” (the size of the coefficients is small) and “as rational as possible”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Benouamer, D. Michelucci, and B. Peroche. Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation. Computer-Aided Design, 26(6):403–416, 1994.
A. Bowyer, J. Berchtold, D. Eisenthal, I. Voiculescu, and K. Wise. Interval methods in geometric modeling. In Proc. of International Conference on Geometric Modeling and Processing, Hong Kong, 2000. Invited presentation.
R. Farouki, C. Neff, and M. O’Connor. Automatic parsing of degenerate quadric-surface intersections. ACM Transactions on Graphics, 8(3): 174–203, 1989.
S. Fortune. Polyhedral modelling with exact arithmetic. In Proc. of ACM Symposium on Solid Modeling and Applications, pages 225–234, 1995.
N. Geismann, M. Hemmer, and E. Schoemer. Computing the intersection of quadrics: exactly and actually. In Proc. of ACM Symposium on Computational Geometry, pages 264–273, 2001.
R. Goldman and J. Miller. Combining algebraic rigor with geometric robustness for the detection and calculation of conic sections in the intersection of two natural quadric surfaces. In Proc. of ACM Symposium on Solid Modeling Foundations and CAD/CAM Applications, pages 221–231, 1991.
C.-K. Hung and D. Ierardi. Constructing convex hulls of quadratic surface patches. In Proceedings of 7th CCCG (Canadian Conference on Computational Geometry), Quebec, Canada, pages 255–260, 1995.
J. Keyser, S. Krishnan, and D. Manocha. Efficient and accurate B-Rep generation of low degree sculptured solids using exact arithmetic: I — Representations. Computer Aided Geometric Design, 16(9):841–859, 1999.
J. Keyser, S. Krishnan, and D. Manocha. Efficient and accurate B-Rep generation of low degree sculptured solids using exact arithmetic: II — Computation. Computer Aided Geometric Design, 16(9):861–882, 1999.
T. Lam. The Algebraic Theory of Quadratic Forms. W.A. Benjamin, Reading, MA, 1973.
J. Levin. A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces. Communications of the ACM, 19(10):555–563, 1976.
J. Levin. Mathematical models for determining the intersections of quadric surfaces. Computer Graphics and Image Processing, 11(1):73–87, 1979.
R. Sarraga. Algebraic methods for intersections of quadric surfaces in GMSOLID. Computer Vision, Graphics, and Image Processing, 22:222–238, 1983.
K. Sugihara. How to make geometric algorithms robust. IEICE Transactions on Information and Systems, E83-D(3):447–454, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dupont, L., Lazard, S., Petitjean, S., Lazard, D. (2002). Towards the Robust Intersection of Implicit Quadrics. In: Winkler, J., Niranjan, M. (eds) Uncertainty in Geometric Computations. The Springer International Series in Engineering and Computer Science, vol 704. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0813-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0813-7_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5252-5
Online ISBN: 978-1-4615-0813-7
eBook Packages: Springer Book Archive