. Kaltofen, thus the ideal Vor1 is not real. Take Vor1 as input and we obtain in 9 sec. the minimal primes of the real radical re Vor1: References Basu, 2006.

E. Becker and R. Neuhaus, Computation of real radicals of polynomial ideals, Computational Algebraic Geometry, vol.109, pp.1-20, 1993.

C. Blanco, G. Jeronimo, and P. Solernó, Computing generators of the ideal of a smooth affine algebraic variety, Journal of Symbolic Computation, vol.38, issue.1, pp.843-872, 2004.

J. Bochnak, M. Coste, and M. Roy, Real algebraic geometry, vol.36, 1998.

D. A. Brake, J. D. Hauenstein, and A. C. Liddell, Validating the completeness of the real solution set of a system of polynomial equations, Proceedings of the 2016 International Symposium on Symbolic and Algebraic Computation. ISSAC'16, pp.143-150, 2016.

C. Chen, J. H. Davenport, J. P. May, M. M. Maza, B. Xia et al., Triangular decomposition of semi-algebraic systems, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. ISSAC'10, pp.187-194, 2010.

C. Chen, J. H. Davenport, J. P. May, M. M. Maza, B. Xia et al., Triangular decomposition of semi-algebraic systems, Journal of Symbolic Computation, vol.49, pp.3-26, 2013.

C. Chen, J. H. Davenport, M. Moreno-maza, B. Xia, and R. Xiao, Computing with semi-algebraic sets represented by triangular decomposition, Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation. ISSAC'11, pp.75-82, 2011.

D. Cox, J. Little, and D. O'shea, Ideals, varieties, and algorithms, vol.3, 1992.

C. Durvye and G. Lecerf, A concise proof of the Kronecker polynomial system solver from scratch, Expositiones Mathematicae, vol.26, issue.2, pp.101-139, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00682083

D. Eisenbud, Commutative Algebra: with a View Toward Algebraic Geometry, vol.150, 1995.

H. Everett, D. Lazard, S. Lazard, and M. Safey-el-din, The Voronoi diagram of three lines, Discrete & Computational Geometry, vol.42, issue.1, pp.94-130, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00172749

G. Fløystad, J. Kileel, and G. Ottaviani, The Chow form of the essential variety in computer vision, Journal of Symbolic Computation, 2017.

I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants, Birkhäuser Boston, 1994.

M. Giusti, G. Lecerf, and B. Salvy, A Gröbner free alternative for polynomial system solving, Journal of complexity, vol.17, issue.1, pp.154-211, 2001.

G. Jeronimo, T. Krick, J. Sabia, and M. Sombra, The computational complexity of the Chow form, Foundations of Computational Mathematics, vol.4, issue.1, pp.41-117, 2004.

M. Kalkbrener, Three contributions to elimination theory, 1991.

E. Kaltofen, Factorization of polynomials given by straight-line programs, Randomness and Computation, vol.5, pp.375-412, 1989.

E. Kaltofen, B. Li, Z. Yang, and L. Zhi, Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars, Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation. ISSAC'08, pp.155-164, 2008.

E. Kaltofen and B. M. Trager, Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators, Journal of Symbolic Computation, vol.9, issue.3, pp.301-320, 1990.

T. Krick, Straight-line programs in polynomial equation solving, Foundations of computational mathematics: Minneapolis, vol.312, pp.96-136, 2002.

J. Lasserre, M. Laurent, B. Mourrain, P. Rostalski, and P. Trébuchet, Moment matrices, border bases and real radical computation, Journal of Symbolic Computation, vol.51, pp.63-85, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01282654

J. B. Lasserre, M. Laurent, and P. Rostalski, Semidefinite characterization and computation of zero-dimensional real radical ideals, Foundations of Computational Mathematics, vol.8, issue.5, pp.607-647, 2008.

P. Lax, On the discriminant of real symmetric matrices, vol.II, pp.577-586, 2005.

D. Lazard, A new method for solving algebraic systems of positive dimension, Discrete Applied Mathematics, vol.33, issue.1-3, pp.147-160, 1991.

G. Lecerf, Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions, Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation. ISSAC'00, pp.209-216, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00186755

G. Lecerf, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Journal of Complexity, vol.19, issue.4, pp.564-596, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00186727

Y. Ma, C. Wang, and L. Zhi, A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals, Journal of Symbolic Computation, vol.72, pp.1-20, 2016.

M. Marshall, Positive polynomials and sums of squares, 2008.

M. Moreno-maza, Calculs de pgcd au-dessus des tours d'extensions simples et résolution des systèmes d'´ equations algébriques, 1997.

R. Neuhaus, Computation of real radicals of polynomial ideals-II, Journal of Pure and Applied Algebra, vol.124, issue.1, pp.261-280, 1998.

A. Poteaux and ´. E. Schost, On the complexity of computing with zero-dimensional triangular sets, Journal of Symbolic Computation, vol.50, pp.110-138, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00825847

M. Safey-el-din, Finding sampling points on real hypersurfaces is easier in singular situations. MEGA (Effective Methods in Algebraic Geometry) Electronic proceedings, 2005.

M. Safey-el-din, RAGLib (Real Algebraic Geometry Library), Maple package, 2007.

M. Safey-el-din, Testing sign conditions on a multivariate polynomial and applications, Mathematics in Computer Science, vol.1, issue.1, pp.177-207, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00105835

M. Safey-el-din and ´. E. Schost, Polar varieties and computation of one point in each connected component of a smooth real algebraic set, Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation. ISSAC'03, pp.224-231, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099649

M. Safey-el-din and ´. E. Schost, Properness defects of projections and computation of at least one point in each connected component of a real algebraic set, Discrete & Computational Geometry, vol.32, issue.3, pp.417-430, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00099962

M. Safey-el-din and ´. E. Schost, A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets, Journal of the ACM, vol.63, issue.6, pp.1-48, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00849057

´. E. Schost, Computing parametric geometric resolutions, Communication and Computing, vol.13, issue.5, pp.349-393, 2003.
DOI : 10.1007/s00200-002-0109-x

S. J. Spang, On the computation of the real radical, 2007.

S. J. Spang, A zero-dimensional approach to compute real radicals, The Computer Science Journal of Moldova, vol.16, issue.1, pp.64-92, 2008.

D. Wang, Decomposing polynomial systems into simple systems, Journal of Symbolic Computation, vol.25, issue.3, pp.295-314, 1998.

W. Wu, Basic principles of mechanical theorem proving in elementary geometries, Journal of Systems Science and Mathematical Sciences, vol.4, pp.207-235, 1984.