P. Agarwal and M. Sharir, Arrangements and their applications. Handbook of Computational Geometry, pp.49-119, 2000.

L. Alberti, G. Comte, and B. Mourrain, Meshing implicit algebraic surfaces: the smooth case, Mathematical Methods for Curves and Surfaces: Tromso'04, pp.11-26, 2005.

L. Alberti and B. Mourrain, Visualisation of Implicit Algebraic Curves, 15th Pacific Conference on Computer Graphics and Applications (PG'07), pp.303-312, 2007.
DOI : 10.1109/PG.2007.32
URL : https://hal.archives-ouvertes.fr/inria-00175062

J. , G. Alcázar, and J. R. Sendra, Computing the topology of real algebraic space curves, J. Symbolic Comput, vol.39, pp.719-744, 2005.

K. Aoki, T. Fukuda, and W. Z. Sun, On the number of branches of a plane curve germ, Kodai Math. Journal, vol.9, pp.179-187, 1986.

S. Basu, R. Pollack, and M. Roy, Algorithms in Real Algebraic Geometry, 2003.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

J. L. Bentley and T. A. Ottmann, Algorithms for Reporting and Counting Geometric Intersections, IEEE Transactions on Computers, vol.28, issue.9, pp.643-647, 1979.
DOI : 10.1109/TC.1979.1675432
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA058768

J. Boissonnat and M. Yvinec, Algorithmic geometry, 1998.
DOI : 10.1017/CBO9781139172998

A. Bowyer, Svlis: Introduction and user manual, 1994.

A. Bowyer, J. Berchtold, D. Eisenthal, I. Voiculescu, and K. Wise, Interval methods in geometric modeling, Proceedings Geometric Modeling and Processing 2000. Theory and Applications, p.321, 2000.
DOI : 10.1109/GMAP.2000.838263

J. Cheng, X. Gao, and M. Li, Determining the Topology of Real Algebraic Surfaces, Mathematics of Surfaces, number 3604 in LNCS, pp.121-146, 2005.
DOI : 10.1007/11537908_8

G. E. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decompostion, Proc. 2nd GI Conference on Automata Theory and Formal Languages, pp.134-183, 1975.
DOI : 10.1007/3-540-07407-4_17

A. Dickenstein, M. J. Rojas, K. Rusekz, and J. Shihx, Extremal real algebraic geometry and a-discriminants, 2007.

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

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. Elkadi and B. Mourrain, IntroductionàIntroduction`Introductionà la résolution des systèmes polynomiaux, Mathématiques et Applications, vol.59, 2007.

Z. Ioannis, B. Emiris, E. P. Mourrain, and . Tsigaridas, Real algebraic numbers: Complexity analysis and experimentations. In Reliable Implementation of Real Number Algorithms: Theory and Practice, LNCS, p.page, 2008.

G. Farin, Curves and surfaces for computer aided geometric design : a practical guide. Comp. science and sci. computing, 1990.

E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design patterns: elements of reusable objectoriented software, 1995.

J. Garloff and A. P. Smith, Investigation of a subdivision based algorithm for solving systems of polynomial equations, Proceedings of the Third World Congress of Nonlinear Analysts, pp.167-178, 2001.
DOI : 10.1016/S0362-546X(01)00166-3

G. Gatellier, A. Labrouzy, B. Mourrain, and J. Técourt, Computing the topology of 3- dimensional algebraic curves, Computational Methods for Algebraic Spline Surfaces, pp.27-44, 2005.

L. González-vega and I. Necula, Efficient topology determination of implicitly defined algebraic plane curves, Computer Aided Geometric Design, vol.19, issue.9, pp.719-743, 2002.
DOI : 10.1016/S0167-8396(02)00167-X

T. A. Grandine and F. W. Klein, A new approach to the surface intersection problem, Computer Aided Geometric Design, vol.14, issue.2, pp.111-134, 1997.
DOI : 10.1016/S0167-8396(96)00024-6

D. Halperin, Arrangements, Handbook of Discrete and Computational Geometry, pp.529-562, 2004.
DOI : 10.1201/9781420035315.ch24

D. Halperin and M. Sharir, Arrangements and their applications in robotics: recent developments, WAFR: Proceedings of the workshop on Algorithmic foundations of robotics, pp.495-511

I. Hanniel and R. Wein, An exact, complete and efficient computation of arrangements of B??zier curves, Proceedings of the 2007 ACM symposium on Solid and physical modeling , SPM '07, pp.253-263, 2007.
DOI : 10.1145/1236246.1236282

J. Hass, R. T. Farouki, C. Y. Han, X. Song, and T. W. Sederberg, Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme, Advances in Computational Mathematics, 2007.
DOI : 10.1007/s10444-005-7539-5

Y. Hijazi and T. Breuel, Computing arrangements using subdivision and interval arithmetic, Proceedings of the Sixth International Conference on Curves and Surfaces Avignon, 2006.

S. Joon-kyung, G. Elber, and K. , Contouring 1- and 2-manifolds in arbitrary dimensions, International Conference on Shape Modeling and Applications 2005 (SMI' 05), pp.218-227, 2005.
DOI : 10.1109/SMI.2005.10

J. Keyser, T. Culver, D. Manocha, and S. Krishnan, Efficient and exact manipulation of algebraic points and curves, Computer-Aided Design, vol.32, issue.11, pp.649-662, 2000.
DOI : 10.1016/S0010-4485(00)00054-3

G. N. Khim?ia?vili, The local degree of a smooth mapping, Sakharth. SSR Mecn. Akad. Moambe, vol.85, issue.2, pp.309-312, 1977.

C. Liang, B. Mourrain, and J. P. Pavone, Subdivision Methods for the Topology of 2d and 3d Implicit Curves, Computational Methods for Algebraic Spline Surfaces, 2006.
DOI : 10.1007/978-3-540-72185-7_11
URL : https://hal.archives-ouvertes.fr/inria-00130216

N. G. Lloyd, Degree theory, Cambridge Tracts in Mathematics, issue.73, 1978.

W. Lorensen and H. Cline, Marching cubes: A high resolution 3D surface construction algorithm, ACM SIGGRAPH Computer Graphics, vol.21, issue.4, pp.163-170, 1987.
DOI : 10.1145/37402.37422

V. Milenkovic, Calculating approximate curve arrangements using rounded arithmetic, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.197-207, 1989.
DOI : 10.1145/73833.73856

V. Milenkovic and E. Sacks, An approximate arrangement algorithm for semi-algebraic curves, SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry, pp.237-246, 2006.

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

B. Mourrain, F. Rouillier, and M. Roy, Bernstein's basis and real root isolation, Mathematical Sciences Research Institute Publications, pp.459-478, 2005.

B. Mourrain, J. Técourt, and M. Teillaud, On the computation of an arrangement of quadrics in 3D, Special issue, 19th European Workshop on Computational Geometry, pp.145-164, 2005.
DOI : 10.1016/j.comgeo.2004.05.003
URL : https://hal.archives-ouvertes.fr/inria-00350858

B. Mourrain and J. P. Técourt, Isotopic meshing of a real algebraic surface, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00070499

B. Mourrain, M. Vrahatis, and J. Yakoubsohn, On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree, Journal of Complexity, vol.18, issue.2, pp.612-640, 2002.
DOI : 10.1006/jcom.2001.0636

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

H. Ratschek and J. G. Rokne, SCCI-HYBRID METHODS FOR 2D CURVE TRACING, International Journal of Image and Graphics, vol.05, issue.03, pp.447-480, 2005.
DOI : 10.1142/S0219467805001859

A. Rösch, M. Ruhl, and D. Saupe, Interactive Visualization of Implicit Surfaces with Singularities, Implicit Surfaces, pp.73-87, 1996.
DOI : 10.1111/1467-8659.00196

T. Sederberg, Algorithm for algebraic curve intersection, Computer-Aided Design, vol.21, issue.9, pp.547-554, 1989.
DOI : 10.1016/0010-4485(89)90015-8

E. C. Sherbrooke and N. M. Patrikalakis, Computation of the solutions of nonlinear polynomial systems, Computer Aided Geometric Design, vol.10, issue.5, pp.379-405, 1993.
DOI : 10.1016/0167-8396(93)90019-Y

F. Stenger, Computing the topological degree of a mapping inR n, Numerische Mathematik, vol.2, issue.1, pp.23-38, 1975.
DOI : 10.1007/BF01419526

Z. Szafraniec, On the number of branches of a $1$-dimensional semianalytic set, Kodai Mathematical Journal, vol.11, issue.1, pp.78-85, 1988.
DOI : 10.2996/kmj/1138038822

J. Zur-gathen and J. Gerhard, Modern computer algebra, 1999.
DOI : 10.1017/CBO9781139856065

J. Wintz and B. Mourrain, A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview, 15th Pacific Conference on Computer Graphics and Applications (PG'07), pp.449-452, 2007.
DOI : 10.1109/PG.2007.18
URL : https://hal.archives-ouvertes.fr/inria-00189560

N. Wolpert, Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves, ESA 2003, pp.532-543, 2003.
DOI : 10.1007/978-3-540-39658-1_49

B. Zalik, M. Gombosi, and D. Podgorelec, A quick intersection algorithm for arbitrary polygons, Spring Conference on Computer Graphics -SCCG98, pp.195-204, 1998.