A. Alesina and M. Galuzzi, Vincent's theorem from a modern point of view. Categorical Studies in Italy, Rendiconti del Circolo Matematico di Palermo, Serie II, issue.64, pp.179-191, 2000.

E. Allgower, M. Erdmann, and K. Georg, On the complexity of exclusion algorithms for optimization, Journal of Complexity, vol.18, issue.2, pp.573-588, 2002.

I. Babuv?ka and W. Rheinboldt, Error estimates for adaptive finite element computations, SIAM Journal on Numerical Analysis, vol.15, issue.4, pp.736-754, 1978.

J. Boissonnat, D. Cohen-steiner, B. Mourrain, G. Rote, and G. Vegter, Meshing of surfaces, Effective Computational Geometry for Curves and Surfaces. Mathematics and Visualization, pp.181-229, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00488274

J. Boissonnat, D. Cohen-steiner, and G. Vegter, Isotopic implicit surface meshing, Discrete & Computational Geometry, vol.1, issue.39, pp.138-157, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00488819

Y. Bouzidi, S. Lazard, G. Moroz, M. Pouget, F. Rouillier et al., Solving bivariate systems using rational univariate representations, J. Complexity, vol.37, pp.34-75, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01342211

P. Bürgisser and F. Cucker, Condition: The geometry of numerical algorithms, vol.349, 2013.

M. Burr, S. W. Choi, B. Galehouse, and C. K. Yap, Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves, Journal of Symbolic Computation, vol.47, issue.2, pp.131-152, 2012.

M. A. Burr, Continuous amortization and extensions: With applications to bisection-based root isolation, Journal of Symbolic Computation, vol.77, pp.78-126, 2016.

M. A. Burr, S. Gao, and E. Tsigaridas, The complexity of an adaptive subdivision method for approximating real curves, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation. ISSAC. ACM, pp.61-68, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01528392

M. A. Burr and F. Krahmer, Sqfreeeval: An (almost) optimal real-root isolation algorithm, Journal of Symbolic Computation, vol.47, issue.2, pp.153-166, 2012.

M. A. Burr, F. Krahmer, and C. K. Yap, Continuous amortization: A non-probabilistic adaptive analysis technique, Electronic Colloquium on Computational Complexity, 2009.

J. Cheng, X. Gao, and L. Guo, Root isolation of zero-dimensional polynomial systems with linear univariate representation, Journal of Symbolic Computation, vol.47, issue.7, pp.843-858, 2012.

J. Cheng, K. Jin, and D. Lazard, Certified rational parametric approximation of real algebraic space curves with local generic position method, Journal of Symbolic Computation, vol.58, pp.18-40, 2013.

S. Cheng, T. Dey, E. Ramos, and T. Ray, Sampling and meshing a surface with guaranteed topology and geometry, SIAM Journal on Computing, vol.37, issue.4, pp.1199-1227, 2007.

G. E. Collins and A. G. Akritas, Polynomial real root isolation using Descarte's rule of signs, Proceedings of the 3rd ACM International Symposium on Symbolic and Algebraic Computation. ISSAC, pp.272-275, 1976.

J. Dedieu and J. Yakoubsohn, Computing the real roots of a polynomial by the exclusion algorithm, Numerical Algorithms, vol.4, issue.1, pp.1-24, 1993.

Z. Du, V. Sharma, and C. K. Yap, Amortized bound for root isolation via Sturm sequences, Symbolic-numeric computation, pp.113-129, 2007.

A. Eigenwillig, V. Sharma, and C. K. Yap, Almost tight recursion tree bounds for the descartes method, Proceedings of the International Symposium on Symbolic and Algebraic Computation. ISSAC, pp.71-78, 2006.

G. Elber and M. Kim, Geometric constraint solver using multivariate rational spline functions, Proceedings of the 6th ACM Symposium on Solid Modeling and Applications, pp.1-10, 2001.

M. Giusti, G. Lecerf, B. Salvy, and J. Yakoubsohn, On location and approximation of clusters of zeros of analytic functions, Foundations of Computational Mathematics, vol.5, issue.3, pp.257-311, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00186736

W. Heiden, T. Goetze, and J. Brickmann, Fast generation of molecular surfaces from 3d data fields with an enhanced "marching cube" algorithm, Journal of Computational Chemistry, vol.14, issue.2, pp.246-250, 1993.

P. Henrici, Methods of search for solving polynomial equations, Journal of the Association for Computing Machinery, vol.17, issue.2, pp.273-283, 1970.

H. Hong and M. Safey-el-din, Variant quantifier elimination, J. Symb. Comput, vol.47, issue.7, pp.883-901, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00778365

G. Jeronimo, D. Perrucci, and E. Tsigaridas, On the minimum of a polynomial function on a basic closed semialgebraic set and applications, SIAM Journal on Optimization, vol.23, issue.1, pp.241-255, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00776280

W. Krandick and K. Mehlhorn, New bounds for the Descartes method, Journal of Symbolic Computation, vol.41, issue.1, pp.49-66, 2006.

R. Krawczyk, Newton-Algorithmen zur Bestimmung von, Nullstellen mit Fehlerschranken. Computing, vol.4, pp.187-201, 1969.

L. Lin, C. Yap, and J. Yu, Non-local isotopic approximation of nonsingular surfaces, Computer-Aided Design, vol.45, issue.2, pp.451-462, 2013.

W. E. Lorensen and H. E. Cline, Marching cubes: A high resolution 3D surface construction algorithm, SIGGRAPH Computer Graphics, vol.21, issue.4, pp.163-169, 1987.

A. Mantzaflaris, B. Mourrain, and E. P. Tsigaridas, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, Theoretical Computer Science, vol.412, issue.22, pp.2312-2330, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00530756

R. E. Moore, R. B. Kearfott, and M. J. Cloud, Introduction to interval analysis, Society for Industrial and Applied Mathematics, 2009.

B. Mourrain and J. Pavone, Subdivision methods for solving polynomial equations, Journal of Symbolic Computation, vol.44, issue.3, pp.292-306, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00070350

V. Y. Pan, Approximating complex polynomial zeros: modified weyl's quadtree construction and improved newton's iteration, Journal of Complexity, vol.16, issue.1, pp.213-264, 2000.

S. Plantinga and G. Vegter, Isotopic approximation of implicit curves and surfaces, Proceedings of Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, pp.245-254, 2004.

S. Plantinga and G. Vegter, Isotopic meshing of implicit surfaces, The Visual Computer, vol.23, pp.45-58, 2007.

H. Ratschek and J. Rokne, Computer methods for the range of functions, Ellis Horwood Series: Mathematics and its Applications, 1984.

M. Sagraloff, When newton meets descartes: A simple and fast algorithm to isolate the real roots of a polynomial, Proc. of the 37th International Symposium on Symbolic and Algebraic Computation (ISSAC), pp.297-304, 2012.

M. Sagraloff and C. Yap, A simple but exact and efficient algorithm for complex root isolation and its complexity analysis, Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation. ISSAC, pp.353-360, 2011.

P. Schröder, Subdivision as a fundamental building block of digital geometry processing algorithms, 15th Toyota Conference: Scientific and Engineering Computations for the 21st Century-Methodologies and Applications, pp.207-219, 2002.

V. Sharma, G. Vegter, and C. Yap, Isotopic arrangement of simple curves: an exact numerical approach based on subdivision, 2011.

J. M. Snyder, Interval analysis for computer graphics, Proceedings of the 19th Annual conference on Computer graphics and interactive techniques, pp.121-130, 1992.

J. Von-zur-gathen and J. Gerhard, Fast algorithms for Taylor shifts and certain difference equations, Proceedings of the 22nd International Symposium on Symbolic and Algebraic Computation. ISSAC. ACM, pp.40-47, 1997.

C. Wang, Y. Chiang, and C. Yap, On soft predicates in subdivision motion planning, Computational Geometry. Theory and Applications, vol.48, issue.8, pp.589-605, 2015.

C. Wang, Y. Chiang, and C. Yap, On soft predicates in subdivision motion planning, Computational Geometry, vol.48, issue.8, pp.589-605, 2015.

J. Yakoubsohn, Approximating the zeros of analytic functions by the exclusion algorithm, Numerical Algorithms, vol.6, issue.1, pp.63-88, 1994.

J. Yakoubsohn, Numerical analysis of a bisection-exclusion method to find zeros of univeriate analytic functions, Journal of Complexity, vol.21, issue.5, pp.652-690, 2005.

C. Yap and L. Lin, Adaptive isotopic approximation of nonsingular curves: the parameterizability and nonlocal isotopy approach, Discrete & Computational Geometry, vol.45, issue.4, pp.760-795, 2011.

C. Yap, M. Sagraloff, and V. Sharma, Analytic root clustering: A complete algorithm using soft zero tests, Conference on Computability in Europe, pp.434-444, 2013.

C. Yap, V. Sharma, and J. Lien, Towards exact numerical voronoi diagrams, Proceedings 9th International Symposium on Voronoi Diagrams in Science and Engineering. ISVD, pp.2-16, 2012.