1. M. Teillaud. Towards dynamic randomized algorithms in computational geometry, volume 758 of Lecture Notes in Computer Science. Springer-Verlag, 1993.

1. Jean-Daniel Boissonnat and Antoine Vigneron. Elementary Algorithms for Reporting Intersections of Curve Segments. Comput. Geom. Theory Appl., 21:167--175, 2002.



2. J.-D. Boissonnat and J. Snoeyink. Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. Comput. Geom. Theory Appl., 16(1):35--52, 2000.



3. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. On the Design of CGAL a Computational Geometry Algorithms Library. Softw. -- Pract. Exp., 30(11):1167--1202, 2000.



4. O. Devillers. An introduction to randomization in computational geometry. Theoret. Comput. Sci., 157:35--52, 1996. [WWW ]



5. O. Devillers and A. Fabri. Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. Internat. J. Comput. Geom. Appl., 6:487--506, 1996. [WWW ]



6. O. Devillers and M. Golin. Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. Inform. Process. Lett., 56(3):157--164, 1995. [WWW ]



7. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput. Geom., 8:51--71, 1992. [WWW ] Keyword(s): randomized algorithms, Delaunay triangulation, semi-dynamic algorithms, arrangement of line-segments.



8. O. Devillers. Randomization yields simple $O(n \log^{*} n)$ algorithms for difficult $\Omega(n)$ problems. Internat. J. Comput. Geom. Appl., 2(1):621--635, 1992. [WWW ] Keyword(s): randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon.

1. O. Chételat, J-P. Merlet, P. Myszkorowski, and R. Longchamp. Globally convergent iterative algorithms for the coordinate transformations in the articulated mechanisms. In Syroco, Nantes, 1997.



2. O. Devillers. An introduction to randomization in computational geometry. In Workshop on Algorithmic Complexity of Algebraic and Geometric Models, 1994. [WWW ]



3. O. Devillers and M. Golin. Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas. In Proc. 6th Canad. Conf. Comput. Geom., pages 153--158, 1994. Keyword(s): Algorithms, Convex Hulls, Circles, Parabolas, Lower Envelopes.



4. O. Devillers, M. Golin, K. Kedem, and S. Schirra. Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. In Proc. 6th Canad. Conf. Comput. Geom., pages 122--127, 1994. Keyword(s): Algorithms, Convex Hulls, Circles, Parabolas, Lower Envelopes.



5. J. Ponce, A. Sudsang, S. Sullivan, B. Faverjon, J-D. Boissonnat, and J-P. Merlet. Algorithms for computing multi-finger force-closure grasps of polyh edral objects. In The First Workshop on the Algorithmic Foundations of Robotics, 1994. A. K. Peters, Boston, MA.



6. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 298--307, 1993.



7. O. Devillers and A. Fabri. Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 277--288, 1993. Springer-Verlag.



8. K. Dobrindt and M. Yvinec. Remembering conflicts in history yields dynamic algorithms. In Proc. 4th Internat. Sympos. on Algorithms and Computation, volume 762 of Lecture Notes in Computer Science, pages 21--30, 1993. Springer-Verlag.



9. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. On-line geometric algorithms with good expected behaviours. In Proc. 13th World Congress on Computation and Applied Math., pages 137--139, 1991.



10. O. Devillers. Simple randomized $O(n \log^{*} n)$ algorithms. In Proc. 3rd Canad. Conf. Comput. Geom., pages 141--144, 1991. Keyword(s): randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon.

1. Pierre Alliez and Craig Gotsman. Recent Advances in Compression of 3D Meshes. Rapport de recherche 4966, INRIA, 2003. [WWW ]



2. Jean-Daniel Boissonnat and Steve Oudot. An Effective Condition for Sampling Surfaces with Guarantees. Rapport de recherche 5064, INRIA, 2003. [WWW ]



3. Olivier Devillers and Philippe Guigue. Inner and Outer Rounding of Set Operations on Lattice Polygonal Regions. Rapport de recherche 5070, INRIA, 2003. [WWW ]



4. Dominique Attali and Jean-Daniel Boissonnat. A Linear Bound on the Complexity of the Delaunay triangulation of points on polyhedral surfaces. Rapport de recherche 4453, INRIA, 2002. [WWW ]



5. V. Borrelli, F. Cazals, and J-M. Morvan. On the angular defect of triangulations and the pointwise approximation of curvatures. Rapport de recherche 4590, INRIA, 2002. [WWW ]



6. Raphaëlle Chaine. A geometric-based convection approach of 3-D reconstruction. Rapport de recherche 4688, INRIA, 2002. [WWW ]



7. Olivier Devillers and Philippe Guigue. Finite Precision Elementary Geometric Constructions. Rapport de recherche 4559, INRIA, 2002. [WWW ]



8. Dominique Attali and Jean-Daniel Boissonnat. Complexity of the Delaunay triangulation of points on polyhedral surfaces. Rapport de recherche 4232, INRIA, 2001. [WWW ]



9. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, and Monique Teillaud. Splitting a Delaunay Triangulation in Linear Time. Rapport de recherche 4160, INRIA, 2001. [WWW ]



10. Olivier Devillers and Pierre-Marie Gandoin. Compression interactive de maillages triangulaires arbitraires. Rapport de recherche 4158, INRIA, 2001. [WWW ]



11. Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Michael Seel. An Adaptable and Extensible Geometry Kernel. Rapport de recherche 4270, INRIA, 2001. [WWW ]



12. Jean-Daniel Boissonnat and Antoine Vigneron. An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments. Rapport de recherche 3999, INRIA, 2000. [WWW ]



13. Olivier Devillers and Pierre-Marie Gandoin. Geometric Compression for Interactive Transmission. Rapport de recherche 3910, INRIA, 2000. [WWW ]



14. Olivier Devillers and Philippe Guigue. Le tampon mélangeur. Rapport de recherche 3988, INRIA, 2000. [WWW ]



15. Jean-Daniel Boissonnat and Antoine Vigneron. Elementary Algorithms for Reporting Intersections of Curve Segments. Rapport de recherche 3825, INRIA, 1999. [WWW ]



16. Olivier Devillers, Alexandra Fronville, Bernard Mourrain, and Monique Teillaud. Exact predicates for circle arcs arrangements. Rapport de recherche 3826, INRIA, 1999. [WWW ]



17. O. Devillers. Computational geometry and discrete computations. Rapport de recherche 3533, INRIA, 1998. [WWW ]



18. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. On the Design of CGAL, the Computational Geometry Algorithms Library. Research Report 3407, INRIA, 1998. [WWW ]



19. P. Alliez, O. Devillers, and J. Snoeyink. Removing Degeneracies by Perturbing the Problem or the World. Research Report 3316, INRIA, 1997. [WWW ]



20. H. Brönnimann, I. Emiris, V. Pan, and S. Pion. Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. Research Report 3213, INRIA, 1997. [WWW ]



21. P. Desnoguès and H. Rakotoarisoa. ARC: Simulateur d'architecture de réseaux de communications. Rapport technique 187, INRIA, 1996. [WWW ]



22. O. Devillers and F. P. Preparata. A probabilistic analysis of the power of arithmetic filters. Rapport de recherche 2971, INRIA, 1996. Note: Also report CS96-27 Brown University. [WWW ]



23. Matthew Katz and Franck Nielsen. On Piercing Sets of Objects. Rapport de recherche 2874, INRIA, 1996. [WWW ]



24. S. Zuyev, P. Desnoguès, and H. Rakotoarisoa. Simulations of large telecommunication networks based on probabilistic modeling. Rapport de recherche 2787, INRIA, 1996. [WWW ]



25. M. Teillaud. Union and Split Operations on Dynamic Trapezoidal Maps. Rapport de recherche 2486, INRIA, 1995. [WWW ]



26. M. de Berg, O. Devillers, K. Dobrindt, and O. Schwarzkopf. Computing a single cell in the union of two simple polygons. Rapport de recherche 2626, INRIA, 1995. [WWW ]



27. O. Devillers and M. Golin. Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas. Rapport de recherche 2280, INRIA, 1994. [WWW ]



28. F. Nielsen and M. Yvinec. Output-Sensitive Convex Hull Algorithms of Planar Convex Objects. Rapport de recherche 2575, INRIA, 1994. [WWW ]



29. O. Devillers and A. Fabri. Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. Rapport de recherche 1882, INRIA, 1993. [WWW ]



30. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. Rapport de recherche 1819, INRIA, 1992. [WWW ]



31. M. Teillaud. Towards dynamic randomized algorithms in computational geometry. Rapport de recherche 1727, INRIA, 1992. Note: English version of a french thesis. [WWW ]



32. O. Devillers. Randomization yields simple $O(n\log^{\star} n)$ algorithms for difficult $\Omega(n)$ problems. Rapport de recherche 1412, INRIA, 1991. [WWW ]



33. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Rapport de recherche 1285, INRIA, 1990. [WWW ] Keyword(s): randomized algorithms, Voronoi, Delaunay, trapezoidal map, dynamic algorithms.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html