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 ,
Convex hulls of objects bounded by algebraic curves, Algorithmica, vol.19, issue.No. 6, pp.533-553, 1991. ,
DOI : 10.1007/BF01759058
Approximations polygonales d'objets convexes du plan pour la G eom etrie Algorithmique, t h ese de doctorat, 1996. ,
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
Fast detection of polyhedral intersection, Theoretical Computer Science, vol.27, issue.3, pp.241-253, 1983. ,
DOI : 10.1016/0304-3975(82)90120-7
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
Computational geometry in a curved world, Algorithmica, vol.17, issue.1-4, pp.421-457, 1990. ,
DOI : 10.1007/BF01840397
Decomposition and intersection of simple splinegons, Algorithmica 3, pp.473-485, 1988. ,
Algorithms in combinatorial geometry, 1987. ,
DOI : 10.1007/978-3-642-61568-9
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
Curves and surfaces for computer aided geometric design: a practical guide, 1997. ,
Colloque Courbes et surfaces B ezierrB-splines, pp.1-31, 1987. ,
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
Incremental computation of planar maps, ACM SIGGRAPH Computer Graphics, vol.23, issue.3, pp.345-354, 1989. ,
DOI : 10.1145/74334.74369
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
Arrangements and spreads, Conference board of the mathematical sciences, 1972. ,
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
Fundamentals of Computing Aided Geometric Design, A K Peters, 1993. ,
Cours de math ematiques, 3 : G eom etrie et cin ematique, 2 e edition, 1996. ,
Geometric continuity and Fr enet continuity of parametric curves, rapport de recherche RR 864-M, 1991. ,
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
Calculating approximate curve arrangements using rounded arrithmetic, A CM Symposium on Computational Geometry, pp.197-207, 1989. ,
Separating two simple polygons by a sequence of translations, Discrete & Computational Geometry, vol.22, issue.2, pp.123-136, 1987. ,
DOI : 10.1007/BF02187902
Computational geometry: an introduction , T exts and Monographs in Computer Science, 1985. ,
DOI : 10.1007/978-1-4612-1098-6
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
Convex Hulls of Piecewise-Smooth Jordan Curves, Journal of Algorithms, vol.8, pp.66-94, 1987. ,
Sweeping arrangements of curves, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.354-363, 1989. ,
DOI : 10.1145/73833.73872
Computational geometry in a curved world, 1986. ,
Contributions a l' etude des arrangements : equivalences combinatoires et perturbations, t h ese de doctorat, 1994. ,