On the computation of an arrangement of quadrics in 3D

Computational Geometry: Theory and Applications

Volumn 30, Issue 2 SPEC. ISS., 2005, Pages 145-164

  Mourrain, Bernard ^a   Técourt, Jean Pierre ^a   Teillaud, Monique ^a  

^a INRIA   (France)

Author keywords

Algebraic number; Arrangement; Certified computation; Implicit surface; Quadric; Rational univariate representation

Indexed keywords

APPLICATIONS; COMPUTATIONAL GEOMETRY;

ALGEBRAIC NUMBERS; ARRANGEMENT; IMPLICIT SURFACES; QUADRIC; RATIONAL UNIVARIATE REPRESENTATION;

ALGEBRA;

EID: 10044269575     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.05.003     Document Type: Conference Paper

References (29)

1. W. Auzinger, and H.J. Stetter An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations Proc. Intern. Conf. on Numerical Math. Int. Series of Numerical Math. vol. 86 1988 Birkhäuser 12 30
2. S. Basu, R. Pollack, and M.-F. Roy Algorithms in Real Algebraic Geometry 2003 Springer-Verlag Berlin 3-540-00973-6
3. L. Busé, M. Elkadi, and B. Mourrain Using projection operators in computer aided geometric design Topics in Algebraic Geometry and Geometric Modeling, Contemporary Mathematics 2003 321 342
4. B. Chazelle, H. Edelsbrunner, L.J. Guibas, and M. Sharir A singly-exponential stratification scheme for real semi-algebraic varieties and its applications Proc. 16th Internat. Colloq. Automata Lang. Program. Lecture Notes Comput. Sci. vol. 372 1989 Springer-Verlag 179 193
5. B. Chazelle, H. Edelsbrunner, L.J. Guibas, and M. Sharir A singly-exponential stratification scheme for real semi-algebraic varieties and its applications Theoret. Comput. Sci. 84 1991 77 105
6. G.E. Collins Quantifier elimination for real closed fields by cylindrical algebraic decomposition Proc. 2nd GI Conference on Automata Theory and Formal Languages Lecture Notes Comput. Sci. vol. 33 1975 Springer-Verlag 134 183
7. R.M. Corless, P.M. Gianni, and B.M. Trager A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots W.W. Küchlin, Proc. ISSAC 1997 133 140
8. R. Descartes Géométrie A Source Book in Mathematics vol. 90-31 1636 Havard University Press
9. L. Dupont, D. Lazard, S. Lazard, and S. Petitjean Near-optimal parameterization of the intersection of quadrics Proc. 19th Annu. ACM Sympos. Comput. Geom. 2003 246 255
10. A. Eigenwillig, L. Kettner, E. Schömer, and N. Wolpert Complete, exact, and efficient computations with cubic curves Proc. 20th Annu. ACM Sympos. Comput. Geom. 2004 submitted for publication
11. M. Elkadi, and B. Mourrain Introduction à la résolution des systèmes d'équations algébriques Notes de cours 2003 Univ. de Nice (p. 310)
12. N. Geismann, M. Hemmer, and E. Schömer Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and actually! Proc. 17th Annu. ACM Sympos. Comput. Geom. 2001 264 273
13. L. Gonzalez-Vega, F. Rouillier, and M.F. Roy Symbolic Recipes for Polynomial System Solving Some Tapas of Computer Algebra 1997 Springer
14. M.T. Goodrich, and R. Tamassia Dynamic trees and dynamic point location SIAM J. Comput. 28 1998 612 636
15. D. Halperin Arrangements J.E. Goodman, J. O'Rourke, Handbook of Discrete and Computational Geometry 1997 CRC Press LLC Boca Raton, FL 389 412
16. J.R. Johnson, and W. Krandick Polynomial real root isolation using approximate arithmetic Proc. 1997 Internat. Symp. Symbolic and Algebraic Comput. (Kihei, HI) 1997 ACM New York 225 232 (electronic)
17. S. Lazard, L.M. Peñaranda, and S. Petitjean Intersecting quadrics: An efficient and exact implementation Proc. 20th Annu. ACM Sympos. Comput. Geom. 2004 submitted for publication
18. F.S. Macaulay On the resolution of a given modular system into primary systems including some properties of Hilbert numbers Proc. London Math. Soc. 1912 66 121
19. K. Mehlhorn, and M. Seel Infimaximal frames: A technique for making lines look like segments Abstracts 17th European Workshop Comput. Geom. 2001 Freie Universität Berlin 78 81
20. B. Mourrain Computing isolated polynomial roots by matrix methods J. Symbolic Comput. (Special Issue on Symbolic-Numeric Algebra for Polynomials) 26 6 1998 715 738
21. B. Mourrain, F. Rouillier, M.-F. Roy, Bernstein's basis and real root isolation, Technical Report 5149, INRIA Rocquencourt, 2004
22. B. Mourrain, and Ph. Trébuchet Algebraic methods for numerical solving Proc. of the 3rd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing'01 (Timisoara, Romania) 2002 42 57
23. B. Mourrain, M. Vrahatis, and J.C. Yakoubsohn On the complexity of isolating real roots and computing with certainty the topological degree J. Complexity 18 2 2002 612 640
24. F. Rouillier Solving zero-dimensional polynomial systems through Rational Univariate Representation App. Alg. Eng. Com. Comp. 9 5 1999 433 461
25. F. Rouillier, and P. Zimmermann Efficient isolation of a polynomial real roots J. Comput. App. Math. 162 1 2003 33 50
26. M.F. Roy Basic algorithms in real algebraic geometry: from Sturm theorem to the existential theory of reals Lectures on Real Geometry in memoriam of Mario Raimondo Exposition in Mathematics vol. 23 1996 1 67
27. M. Sharir, and P.K. Agarwal Davenport-Schinzel Sequences and Their Geometric Applications 1995 Cambridge University Press New York
28. H. Shaul, and D. Halperin Improved construction of vertical decompositions of three-dimensional arrangements Proc. 18th Annu. ACM Sympos. Comput. Geom. 2002 283 292
29. Ph. Trébuchet, Vers une résolution stable et rapide des équations algébriques, PhD Thesis, Université Pierre et Marie Curie, 2002