Near-optimal parameterization of the intersection of quadrics

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 246-255

  Dupont, Laurent ^a   Lazard, Sylvain ^a   Lazard, Daniel ^b   Petitjean, Sylvain ^a  

^a LORIA   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Quadric surface intersection; Robustness of geometric computations

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR ALGEBRA; NUMBER THEORY; PARAMETER ESTIMATION; THREE DIMENSIONAL COMPUTER GRAPHICS;

NEAR-OPTIMAL PARAMETERIZATION;

COMPUTATIONAL GEOMETRY;

EID: 0038376477     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777829.777830     Document Type: Conference Paper

References (27)

1. L. Alonso, F. Cuny, S. Petitjean, J.-C. Paul, S. Lazard, and E. Wies. The virtual mesh: A geometric abstraction for efficiently computing radiosity. ACM Transactions on Graphics, 20(3):169-201, 2001.
2. 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.
3. 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.
4. J. Cremona. Reduction of binary cubic and quartic forms. LMS Journal of Computation and Mathematics, 2:62-92, 1999.
5. J. Cremona and D. Rusin. Efficient solution of rational conics. Mathematics of Computation, posted on December 18, 2002 (to appear in print).
6. L. Dupont, D. Lazard, S. Lazard, and S. Petitjean. Towards the robust intersection of implicit quadrics. In Proc. of Workshop on Uncertainty in Geometric Computations, 2001. Sheffield, UK.
7. R. Farouki, C. Neff, and M. O'Connor. Automatic parsing of degenerate quadrio-surface intersections. ACM Transactions on Graphics, 8(3): 174-203, 1989.
8. P. Finsler. Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen. Comment. Math. Helv., 9:188-192, 1936/1937.
9. S. Fortune. Polyhedral modelling with exact arithmetic. In Proc. of ACM Symposium on Solid Modeling and Applications, pages 225-234, 1995.
10. 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.
11. 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.
12. J. Harris. Algebraic Geometry: A First Course. Graduate Texts in Mathematics. Springer-Verlag, 1992.
13. C. Hoffmann. Robustness in geometric computations. Journal of Computing and Information Science in Engineering, 1(2):143-156, 2001.
14. J. Keyser, T. Culver, M. Foskey, and S. Krishnan. ESOLID - A system for exact boundary evaluation. In Proc. of 7th ACM Symposium on Solid Modeling and Applications, pp. 23-34, 2002.
15. J. Keyser, T. Culver, D. Manocha, and S. Krishnan. Efficient and exact manipulation of algebraic points and curves. Computer-Aided Design, 32(11):649-662, 2000. Special issue on robustness.
16. J. Keyser, S. Krishnan, and D. Manocha. Efficient and accurate B-Rep generation of low degree sculptured solids using exact arithmetic: I - Representations, II - Computation. Computer Aided Geometric Design, 16(9):841-859, 861-882, 1999.
17. T. Lam. The Algebraic Theory of Quadratic Forms. W.A. Benjamin, Reading, MA, 1973.
18. J. Levin. A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces. Communications of the ACM, 19(10):555-563, 1976.
19. J. Levin. Mathematical models for determining the intersections of quadric surfaces. Computer Graphics and Image Processing, 11(1):73-87, 1979.
20. J. Miller and R. Goldman. Geometric algorithms for detecting and calculating all conic sections in the intersection of any two natural quadric surfaces. Graphical Models and Image Processing, 57(1):55-66, 1995.
21. MuPAD, the open computer algebra system, www.sciface.com.
22. F. Rouillier and P. Zimmermann. Efficient isolation of a polynomial real roots. Journal of Computational and Applied Mathematics, 2002. To appear. Technical Report RR-4113, Inria, 2001.
23. C.-K. Shene and J. Johnstone. On the lower degree intersections of two natural quadrics. ACM Transactions on Graphics, 13(4):400-424, 1994.
24. K. Sugihara. How to make geometric algorithms robust. IEICE Transactions on Information and Systems, E83-D(3):447-454, 2000.
25. F. Uhlig. Simultaneous block diagonalization of two real symmetric matrices. Linear Algebra and Its Applications, 7:281-289, 1973.
26. F. Uhlig. A canonical form for a pair of real symmetric matrices that generate a nonsingular pencil. Linear Algebra and Its Applications, 14:189-209, 1976.
27. I. Wilf and Y. Manor. Quadric-surface intersection curves: shape and structure. Computer-Aided Design, 25(10):633-643, 1993.