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.
DOI : 10.1006/jcom.2002.0638

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.
DOI : 10.1137/0715049

J. Boissonnat, D. Cohen-steiner, B. Mourrain, G. Rote, and G. Vegter, Meshing of Surfaces, Effective Computational Geometry for Curves and Surfaces, pp.181-229, 2006.
DOI : 10.1007/978-3-540-33259-6_5
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.
DOI : 10.1007/s00454-007-9011-4
URL : https://hal.archives-ouvertes.fr/hal-00488819

M. Burr, S. W. Choi, B. Galehouse, and C. K. Yap, Complete subdivision algorithms, II, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.131-152, 2012.
DOI : 10.1145/1390768.1390783

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

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.
DOI : 10.1016/j.jsc.2011.08.022
URL : http://doi.org/10.1016/j.jsc.2011.08.022

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.47843-858, 2012.
DOI : 10.1016/j.jsc.2011.12.011
URL : http://arxiv.org/abs/1102.4681

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.
DOI : 10.1016/j.jsc.2013.06.004
URL : http://arxiv.org/abs/1204.0905

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.
DOI : 10.1137/060665889
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.1206

G. E. Collins and A. G. Akritas, Polynomial real root isolation using Descarte's rule of signs, Proceedings of the third ACM symposium on Symbolic and algebraic computation , SYMSAC '76, pp.272-275, 1976.
DOI : 10.1145/800205.806346
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.9379

C. D. Andrea, T. Krick, and M. Sombra, Heights of varieties in multiprojective spaces and arithmetic nullstellensätze, Annales scientifiques de l' ´ Ecole Normale Supérieure, pp.549-627, 2013.

J. Dedieu and J. Yakoubsohn, Computing the real roots of a polynomial by the exclusion algorithm, Numerical Algorithms, vol.20, issue.1, pp.1-24, 1993.
DOI : 10.1007/BF02142738

A. Eigenwillig, V. Sharma, and C. K. Yap, Almost tight recursion tree bounds for the Descartes method, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.71-78, 2006.
DOI : 10.1145/1145768.1145786
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.7463

G. Elber and M. Kim, Geometric constraint solver using multivariate rational spline functions, Proceedings of the sixth ACM symposium on Solid modeling and applications , SMA '01, pp.1-10, 2001.
DOI : 10.1145/376957.376958

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.
DOI : 10.1007/s10208-004-0144-z
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.28, issue.2, pp.246-250, 1993.
DOI : 10.1002/jcc.540140212

P. Henrici, Methods of Search for Solving Polynomial Equations, Journal of the ACM, vol.17, issue.2, pp.273-283, 1970.
DOI : 10.1145/321574.321581

R. Krawczyk, Newton-algorithms for evaluation of roots with error bounds, Computing, vol.47, issue.3, pp.187-201, 1969.
DOI : 10.1007/BF02234767

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.
DOI : 10.1016/j.cad.2012.10.028

W. E. Lorensen and H. E. Cline, Marching cubes: A high resolution 3D surface construction algorithm, ACM SIGGRAPH Computer Graphics, vol.21, issue.4, pp.163-169, 1987.
DOI : 10.1145/37402.37422
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.3930

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.
DOI : 10.1016/j.tcs.2011.01.009
URL : https://hal.archives-ouvertes.fr/inria-00530756

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

S. Plantinga and G. Vegter, Isotopic approximation of implicit curves and surfaces, Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing , SGP '04, pp.245-254, 2004.
DOI : 10.1145/1057432.1057465
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.2384

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

M. Sagraloff and C. Yap, A simple but exact and efficient algorithm for complex root isolation and its complexity analysis, Proc. of the 36th Int'l 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, 2002.
DOI : 10.1016/S0377-0427(02)00530-7

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, Proc. of the 19th Annual conference on Computer graphics and interactive techniques, pp.121-130, 1992.
DOI : 10.1145/142920.134024
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.7431

M. Sombra, Estimaciones para el teorema de ceros de Hilbert, 1998.

J. Zur-gathen and J. Gerhard, Fast algorithms for Taylor shifts and certain difference equations, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.40-47, 1997.
DOI : 10.1145/258726.258745

C. Wang, Y. Chiang, and C. Yap, On soft predicates in subdivision motion planning, Proc. of the 20th Annual Symposium on Computational Geometry, pp.349-358, 2013.
DOI : 10.1145/2493132.2462386
URL : http://cis.poly.edu/chiang/CGTA-robot.pdf

C. Wang, Y. Chiang, and C. Yap, On soft predicates in subdivision motion planning, Computational Geometry, vol.48, issue.8, pp.589-605, 2015.
DOI : 10.1016/j.comgeo.2015.04.002
URL : http://cis.poly.edu/chiang/CGTA-robot.pdf

J. Yakoubsohn, Approximating the zeros of analytic functions by the exclusion algorithm, Numerical Algorithms, vol.4, issue.1, pp.63-88, 1994.
DOI : 10.1007/BF02149763

J. Yakoubsohn, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Journal of Complexity, vol.21, issue.5, pp.652-690, 2005.
DOI : 10.1016/j.jco.2005.06.007

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.
DOI : 10.1007/978-3-642-39053-1_51
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.7883

C. Yap, V. Sharma, and J. Lien, Towards exact numerical Voronoi diagrams, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering, pp.2-16, 2012.
DOI : 10.1109/ISVD.2012.31