K. Pankaj, B. Agarwal, M. Aronov, and . Sharir, Line traversals of balls and smallest enclosing cylinders in three dimensions, Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pp.483-492, 1997.

K. Pankaj, B. Agarwal, M. Aronov, and . Sharir, Exact and approximation algorithms for minimum-width cylindrical shells, Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp.510-517, 2000.

E. Anderson, Z. Bai, C. Bischof, J. W. Demmel, J. J. Dongara et al., LAPACK : A portable linear algebra library for highperformance computers, 1990.

J. Basch, O. Devillers, M. Van-kreveld, M. Teillaud, and A. Vigneron, On the number of Delaunay triangulations of the projections of a set of points in three dimensions

O. Bottema and G. R. Veldkamp, On the lines in space with equal distances to n given points, Geometriae Dedicata, vol.6, issue.1, pp.121-129, 1977.
DOI : 10.1007/BF00181587

R. M. Corless, P. M. Gianni, and B. M. Trager, A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.133-140, 1997.
DOI : 10.1145/258726.258767

D. Cox, J. Little, and D. Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics, 1992.

O. Devillers, P. Franco, and . Preparata, Evaluating the cylindricity of a nominally cylindrical point set, Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp.518-527, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00412600

I. M. Donald, J. Pach, and T. Theobald, Common tangents to four unit balls in R 3, Discrete Comput. Geom

M. Elkadi and B. Mourrain, IntroductionàIntroduction`Introductionà la résolution des systèmes d'´ equations algébriques, 2003.

I. Z. Emiris and B. Mourrain, Matrices in Elimination Theory, Journal of Symbolic Computation, vol.28, issue.1-2, pp.3-44, 1999.
DOI : 10.1006/jsco.1998.0266

D. Lichtblau, Finding cylinders through 5 points in R 3

B. Mourrain, Computing isolated polynomial roots by matrix methods, J. of Symbolic Computation, Special Issue on Symbolic-Numeric Algebra for Polynomials, vol.26, issue.6, pp.715-738, 1998.
DOI : 10.1006/jsco.1998.0236
URL : http://doi.org/10.1006/jsco.1998.0236

B. Mourrain, A New Criterion for Normal Form Algorithms, Proc. AAECC, pp.430-443, 1999.
DOI : 10.1007/3-540-46796-3_41

B. Mourrain and H. Prieto, A framework for symbolic and numeric computations, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072629

B. Mourrain, . Ph, and . Trébuchet, Solving projective complete intersection faster, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.231-238, 2000.
DOI : 10.1145/345542.345642
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7274

E. Schömer, J. Sellen, M. Teichmann, and C. Yap, Smallest enclosing cylinders, Proc. 12th Annu. ACM Sympos, pp.13-14, 1996.