A. Trianglesarrangement, triangle T 3. liste segm inters SI 4. polygones contr1, contr2, contr3, supp1, supp2, supp3 5. liste segm inters c1, c2, c3, s1, s2, s3 6. begin 7. pour tout T 2 T 8. begin 9. cr eation poly contrrsuppA,T.premi ere courbe,contr1,supp1 10. cr eation poly contrrsuppA,T.seconde courbe,contr2,supp2 11. cr eation poly contrrsuppA,T.troisi eme courbe,contr3,supp3 12, pp.3-4

B. Bajaj, C. Kim, and M. , Convex hulls of objects bounded by algebraic curves, Algorithmica, vol.19, issue.No. 6, pp.533-553, 1991.
DOI : 10.1007/BF01759058

C. Calcoen and E. , Approximations polygonales d'objets convexes du plan pour la G eom etrie Algorithmique, t h ese de doctorat, 1996.

C. Cho, W. Maekawa, T. Patrikalakis, and N. M. , Topologically reliable approximation of composite B??zier curves, Computer Aided Geometric Design, vol.13, issue.6, pp.497-520, 1996.
DOI : 10.1016/0167-8396(95)00042-9

D. Dobkin, D. P. Et-kirkpatrick, and D. G. , Fast detection of polyhedral intersection, Theoretical Computer Science, vol.27, issue.3, pp.241-253, 1983.
DOI : 10.1016/0304-3975(82)90120-7

D. Dobkin, D. P. Et-kirkpatrick, and D. G. , A linear algorithm for determining the separation of convex polyhedra, Journal of Algorithms, vol.6, issue.3, pp.381-392, 1985.
DOI : 10.1016/0196-6774(85)90007-0

D. Dobkin, D. P. Souvaine, and D. L. , Computational geometry in a curved world, Algorithmica, vol.17, issue.1-4, pp.421-457, 1990.
DOI : 10.1007/BF01840397

D. Dobkin, D. P. Souvaine, D. L. Van-wyk, and C. J. , Decomposition and intersection of simple splinegons, Algorithmica 3, pp.473-485, 1988.

E. Edelsbrunner and H. , Algorithms in combinatorial geometry, 1987.
DOI : 10.1007/978-3-642-61568-9

E. Edelsbrunner, H. Guibas, L. Pach, J. Seidel, R. Et-sharir et al., Arrangements of curves in the plane???topology, combinatorics, and algorithms, Theoretical Computer Science, vol.92, issue.2, pp.319-336, 1992.
DOI : 10.1016/0304-3975(92)90319-B

F. Farin and G. , Curves and surfaces for computer aided geometric design: a practical guide, 1997.

F. Fiorot, J. C. Courbes, and B. Ezier, Colloque Courbes et surfaces B ezierrB-splines, pp.1-31, 1987.

F. Fortune, S. Et-milenkovi-c, and V. , Numerical stability of algorithms for line arrangements, Proceedings of the seventh annual symposium on Computational geometry , SCG '91, pp.334-341, 1991.
DOI : 10.1145/109648.109685

G. Gangnet, M. Herv-e, J. Pudet, T. Et-van-thong, and J. , Incremental computation of planar maps, ACM SIGGRAPH Computer Graphics, vol.23, issue.3, pp.345-354, 1989.
DOI : 10.1145/74334.74369

G. Graham, R. L. Yao, and F. F. , Finding the convex hull of a simple polygon, Journal of Algorithms, vol.4, issue.4, pp.324-331, 1983.
DOI : 10.1016/0196-6774(83)90013-5

B. Gr-u722-gr-unbaum, Arrangements and spreads, Conference board of the mathematical sciences, 1972.

G. Guibas, L. Sharir, M. Sifrony, and S. , On the general motion-planning problem with two degrees of freedom, Discrete & Computational Geometry, vol.3, issue.3, pp.491-521, 1989.
DOI : 10.1007/BF02187744

H. Hoschek, J. Lasser, and D. , Fundamentals of Computing Aided Geometric Design, A K Peters, 1993.

L. Lelong-ferrand, J. Arnaudi-es, and J. M. , Cours de math ematiques, 3 : G eom etrie et cin ematique, 2 e edition, 1996.

M. Mazure and M. , Geometric continuity and Fr enet continuity of parametric curves, rapport de recherche RR 864-M, 1991.

M. Mcmullen, P. Shephard, and G. C. , On the upper-bound conjecture for convex polytopes, Journal of Combinatorial Theory, Series B, vol.10, issue.3, 1971.
DOI : 10.1016/0095-8956(71)90042-6

M. Milenkovi-c and V. , Calculating approximate curve arrangements using rounded arrithmetic, A CM Symposium on Computational Geometry, pp.197-207, 1989.

P. Pollack, R. Sharir, M. Et-sifrony, and S. , Separating two simple polygons by a sequence of translations, Discrete & Computational Geometry, vol.22, issue.2, pp.123-136, 1987.
DOI : 10.1007/BF02187902

P. Preparata, F. P. Et-shamos, and M. I. , Computational geometry: an introduction , T exts and Monographs in Computer Science, 1985.
DOI : 10.1007/978-1-4612-1098-6

S. Salesin, D. Stoll, J. Guibas, and L. , Epsilon geometry: building robust algorithms from imprecise computations, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.208-217, 1989.
DOI : 10.1145/73833.73857

S. Schh-aaer, A. Van-wyk, and C. , Convex Hulls of Piecewise-Smooth Jordan Curves, Journal of Algorithms, vol.8, pp.66-94, 1987.

S. Snoeyink, J. Et-hershberger, and J. , Sweeping arrangements of curves, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.354-363, 1989.
DOI : 10.1145/73833.73872

S. Souvaine and D. L. , Computational geometry in a curved world, 1986.

V. Vo-phi and K. , Contributions a l' etude des arrangements : equivalences combinatoires et perturbations, t h ese de doctorat, 1994.