1. Jean-Daniel Boissonnat and Monique Teillaud, editors. Effective Computational Geometry for Curves and Surfaces. Springer-Verlag, 2006. [WWW]



2. Jean-Daniel Boissonnat and Jack Snoeyink, editors. Computational Geometry: Theory and Applications, 35(1-2) 2006. Note: Special Issue on the 20th Symposium on Computational Geometry.



3. Jean-Daniel Boissonnat and Jack Snoeyink, editors. Discrete and Computational Geometry, 36(4) 2006. Note: Special Issue on the 20th Symposium on Computational Geometry.



4. Jean-Daniel Boissonnat, Joel Burdick, Ken Goldberg, and Seth Hutchinson, editors. Algorithmic Foundations of Robotics V. Springer, 2004. ISBN: 3-540-40476-7.



5. Jean-Daniel Boissonnat and Mariette Yvinec. Algorithmic geometry. Cambridge University Press, UK, 1998. Note: Traduit de la version française (Ediscience international) par Hervé Brönnimann. [WWW]



6. J-D. Boissonnat and M. Yvinec. Géométrie algorithmique. Ediscience international, Paris, 1995. [WWW]



7. J-D. Boissonnat and O. Devillers, editors. Journées de Géométrie Algorithmique, 1990. INRIA.



8. J-D. Boissonnat and J-P. Laumond, editors. Geometry and Robotics, volume 391 of Lecture Notes in Computer Science. Springer-Verlag, 1989.

1. Jean-Daniel Boissonnat. Géométrie, algorithmes et robotique. Habilitation à diriger des recherches, Université de Nice Sophia Antipolis, France, 1992.

1. Jean-Daniel Boissonnat and Arijit Ghosh. Triangulating Smooth Submanifolds with Light Scaffolding. Mathematics in Computer Science, 4(4):431-462, 2011. [WWW]



2. Jean-Daniel Boissonnat, Frank Nielsen, and Richard Nock. Bregman Voronoi Diagrams. Discrete and Computational Geometry, 44(2), 2010. [WWW]



3. Jean-Daniel Boissonnat, Leonidas J. Guibas, and Steve Oudot. Manifold reconstruction in arbitrary dimensions using witness complexes. Discrete and Computational Geometry, 42(1):37-70, 2009. [WWW]



4. Dobrina Boltcheva, Mariette Yvinec, and Jean-Daniel Boissonnat. Feature preserving Delaunay mesh generation from 3D multi- material images. Computer Graphics Forum, 28:1455-14645, 2009. Note: Special issue 6th Annu. Sympos. Geometry Processing. [WWW]



5. Jean-Daniel Boissonnat, David Cohen-Steiner, and Gert Vegter. Isotopic implicit surface meshing. Discrete and Computational Geometry, 39:138-157, 2008. [WWW]



6. Jean-Daniel Boissonnat, Camille Wormser, and Mariette Yvinec. Anisotropic diagrams: the Labelle Shewchuk approach revisited. Theoretical Computer Science, 408:163-173, 2008. [WWW]



7. Pooran Memari and Jean-Daniel Boissonnat. Provably Good 2D Shape Reconstruction from Unorganized Cross-Sections. Computer Graphics Forum, 27:1403-1410, 2008. Note: Proceedings of SGP 2008.



8. Jean-Daniel Boissonnat, Leo Guibas, and Steve Oudot. Learning smooth shapes by probing. Comput. Geom. Theory and Appl., 37:38-58, 2007.



9. Jean-Daniel Boissonnat and Jean-Philippe Pons. A Lagrangian approach to dynamic interfaces through kinetic triangulations of the ambient space. Computer Graphics Forum, 26, 2007. [WWW]



10. D. Attali, J-D. Boissonnat, and H. Edelsbrunner. Stability and Computation of Medial Axes: a State of the Art Report. In B. Hamann T. Möller and B. Russell, editors, Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration. Springer-Verlag, Mathematics and Visualization, 2007. [WWW]



11. Silvia Biasotti, Dominique Attali, Jean-Daniel Boissonnat, Herbert Edelsbrunner, Gershon Elber, Michela Mortara, Gabriella Sanniti di Baja, Michela Spagnuolo, and Mirela Tanase. Skeletal Structures. In Leila de Floriani and Michela Spagnuolo, editors, Shape Analysis and Structuring, Mathematics and Visualization. Springer, Berlin, 2007.



12. Jean-Daniel Boissonnat, David Cohen-Steiner, Bernard Mourrain, Günter Rote, and Gert Vegter. Meshing of Surfaces. In Jean-Daniel Boissonnat and Monique Teillaud, editors, Effective Computational Geometry for Curves and Surfaces, pages 181-229. Springer-Verlag, Mathematics and Visualization, 2006. [WWW]



13. Jean-Daniel Boissonnat, Camille Wormser, and Mariette Yvinec. Curved Voronoi Diagrams. In Jean-Daniel Boissonnat and Monique Teillaud, editors, Effective Computational Geometry for Curves and Surfaces, pages 67-116. Springer-Verlag, Mathematics and Visualization, 2006. [WWW]



14. J.D. Boissonnat, R. Chaine, P. Frey, G. Malandain, S. Salmon, E. Saltel, and M. Thiriet. From arteriographies to computational flow in saccular aneurisms: the INRIA experience. Medical Image Analysis, 9(2):101-177, 2005.



15. Jean-Daniel Boissonnat and Steve Oudot. Provably good sampling and meshing of surfaces. Graphical Models, 67:405-451, 2005. [WWW]



16. Jean-Daniel Boissonnat. Voronoi diagrams, triangulations and surfaces. In J.-M. Morvan and M. Boucetta, editors, Differential Geometry and Topology, Computational Geometry, volume 197 of Science Series III: Computer and Systems Sciences, pages 340-368. NATO, 2005.



17. Dominique Attali and Jean-Daniel Boissonnat. A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. Discrete and Computational Geometry, 31:369-384, 2004. [WWW]



18. Jean-Daniel Boissonnat and Julia Flötotto. A coordinate system associated with points scattered on a surface. Computer-Aided Design, 36:161-174, 2004.



19. Dominique Attali and Jean-Daniel Boissonnat. Complexity of the Delaunay triangulation of points on polyhedral surfaces. Discrete and Computational Geometry, 30(3):437-452, 2003.



20. Jean-Daniel Boissonnat and Sylvain Lazard. A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles. Internat. J. Comput. Geom. Appl., 13:189-229, 2003.



21. Jean-Daniel Boissonnat and Frédéric Cazals. Smooth Surface Reconstruction via Natural Neighbour Interpolation of Distance Functions. Computational Geometry: Theory and Applications, pp 185-203, 2002.



22. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Pion, Monique Teillaud, and Mariette Yvinec. Triangulations in CGAL. Computational Geometry: Theory and Applications, 22:5-19, 2002. [WWW] [doi:10.1016/S0925-7721(01)00054-2]



23. J.-D. Boissonnat, S.K. Ghosh, T. Kavitha, and S. Lazard. An algorithm for computing a convex and simple path of bounded curvature in a simple polygon. Algorithmica, 34:109-156, 2002.



24. Jean-Daniel Boissonnat and Antoine Vigneron. Elementary Algorithms for Reporting Intersections of Curve Segments. Computational Geometry: Theory and Applications, 21:167-175, 2002.



25. Ève Coste-Manière, Louaï Adhami, Renaud Severac-Bastide, Jean-Daniel Boissonnat, and Alain Carpentier. Plannification et simulation de chirurgie mini-invasive robotisée. Comptes rendus Biologies, 325(4):321-326, 2002.



26. Grégoire Malandain and Jean-Daniel Boissonnat. Computing the Diameter of a Point Set. Internat. J. Comput. Geom. Appl., 12(6):489-510, 2002.



27. Jean-Daniel Boissonnat. Reconstruire des surfaces pour l'imagerie. In L'explosion des mathématiques. SMF-SMAI, 2002.



28. J-D. Boissonnat and F. Cazals. Coarse-to-fine surface simplification with geometric guarantees. Computer Graphics Forum, 20, 2001.



29. Jean-Daniel Boissonnat and Frédéric Cazals. Natural Coordinates of Points on a Surface. Computational Geometry: Theory and Applications, 19:155-173, 2001.



30. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, and Mariette Yvinec. Circular Separability of Polygons. Algorithmica, 30:67-82, 2001. [WWW]



31. G. Courrioux, S. Nullans, A. Guillen, J-D Boissonnat, P. Repusseau, X. Renaud, and M. Thibaut. 3D volumetric modelling of Cadomian terranes (Northern Brittany, France): an automatic method using Voronoi diagrams. Tectonophysics, 331:181-196, 2001.



32. Jean-Daniel Boissonnat. Le calcul géométrique.. Techniques et Sciences Informatiques, 19:93-99, 2000.



33. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, and Mariette Yvinec. Computing Largest Circles Separating Two Sets of Segments. Internat. J. Comput. Geom. Appl., 10:41-54, 2000. [WWW] [doi:10.1142/S0218195900000036]



34. Jean-Daniel Boissonnat, Olivier Devillers, and Sylvain Lazard. Motion Planning of Legged Robots. SIAM Journal on Computing, 30:218-246, 2000. [WWW]



35. Jean-Daniel Boissonnat and Franco P. Preparata. Robust plane sweep for intersecting segments. SIAM Journal on Computing, 29:1401-1421, 2000.



36. J.-D. Boissonnat and J. Snoeyink. Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates. Computational Geometry: Theory and Applications, 16(1):35-52, 2000.



37. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, and Mariette Yvinec. Convex Tours of Bounded Curvature. Computational Geometry: Theory and Applications, 13:149-160, 1999. [WWW]



38. Jean-Daniel Boissonnat, André Cérézo, Elena Degtiariova-Kostova, Vladimir Kostov, and Juliette Leblond. Shortest plane paths with bounded derivative of the curvature. C. R. Acad. Sci., 329-I:613-618, 1999.



39. J.-D. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec. Voronoi Diagrams in Higher Dimensions Under Certain Polyhedra Distance Functions. Discrete and Computational Geometry, 14:485-519, 1998.



40. J-D. Boissonnat, E. de Lange, and M. Teillaud. Slicing Minkowski Sums for Satellite Antenna Layout. Computer-Aided Design, 30(4):255-265, 1998. Note: Special Issue on Computational Geometry and Computer-Aided Design and Manufacturing.



41. F. Avnaim, J-D. Boissonnat, O. Devillers, F. P. Preparata, and M. Yvinec. Evaluating signs of determinants using single-precision arithmetic. Algorithmica, 17:111-132, 1997. [WWW]



42. J. Ponce, A. Sudsang, S. Sullivan, B. Faverjon, J-D. Boissonnat, and J-P. Merlet. On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects. International Journal of Robotics Research, 16(1):11-35, 1997.



43. J-D. Boissonnat, A. Cérézo, O. Devillers, J. Duquesne, and M. Yvinec. An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension $d$. Computational Geometry: Theory and Applications, 6:123-130, 1996. [WWW]



44. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. Output-sensitive construction of the Delaunay triangulation of points lying in two planes. Internat. J. Comput. Geom. Appl., 6(1):1-14, 1996. [WWW] [doi:10.1142/S0218195996000022]



45. J-D. Boissonnat and K. Dobrindt. Randomized construction of the upper envelope of triangles in ${\rm I \! R}^3$. Computational Geometry: Theory and Applications, 5(6):293-342, 1996.



46. J.-D. Boissonnat, O. Devillers, L. Donati, and F. P. Preparata. Motion planning of legged robots: the spider robot problem. Internat. J. Comput. Geom. Appl., 5(1& 2):3-20, 1995. [WWW] [doi:10.1142/S0218195995000027]



47. J.-D. Boissonnat, A. Cérézo, and J. Leblond. Shortest paths of bounded curvature in the plane. Journal of Intelligent Systems, 10:1-16, 1994.



48. J-D. Boissonnat, O. Devillers, J. Duquesne, and M. Yvinec. Computing Connolly Surfaces. J. Mol. Graphics, 12:61-62, 1994. [WWW] [doi:10.1016/0263-7855(94)80033-2]



49. J.-D. Boissonnat, O. Devillers, and M. Teillaud. A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis. Algorithmica, 9:329-356, 1993. [WWW] Keyword(s): randomized algorithms, higher order Voronoi diagrams, dynamic algorithms.



50. Jean-Daniel Boissonnat and Jean-Paul Laumond. Garer un robot mobile. Courrier du CNRS, 80, 1993.



51. J.-D. Boissonnat and M. Teillaud. On the randomized construction of the Delaunay tree. Theoret. Comput. Sci., 112:339-354, 1993. [WWW] Keyword(s): randomized algorithms, Delaunay triangulation, semi-dynamic algorithms.



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



53. J.-D. Boissonnat and M. Yvinec. Probing a scene of non-convex polyhedra. Algorithmica, 8:321-342, 1992. Keyword(s): geometric probing, polyhedral scenes.



54. P. Alevizos, J. D. Boissonnat, and F. P. Preparata. An optimal algorithm for the boundary of a cell in a union of rays: corrigendum. Algorithmica, 6:292-293, 1991.



55. Jean-Daniel Boissonnat. Informatique et géométrie : quand l'ordinateur remplace la règle et le compas. Annales des Mines, 1991.



56. J.-D. Boissonnat, O. Devillers, and F. P. Preparata. Computing the union of $3$-colored triangles. Internat. J. Comput. Geom. Appl., 1(2):187-196, 1991. [WWW] [doi:10.1142/S021819599100013X] Keyword(s): convex hull, motion plannig, legged robot.



57. P. Alevizos, J. D. Boissonnat, and F. P. Preparata. An optimal algorithm for the boundary of a cell in a union of rays. Algorithmica, 5:573-590, 1990. Note: (corrigendum 1991:292--293).



58. P. Alevizos, J-D. Boissonnat, and M. Yvinec. Non convex contour reconstruction. Journal Symbolic Comput., 10:225-252, 1990.



59. Jean-Daniel Boissonnat, Olivier Faugeras, and Elisabeth Lebras. Representing Stereo Data with the Delaunay Triangulation. Artificial Intelligence, 44:41-87, 1990.



60. F. Avnaim and J.-D. Boissonnat. Polygon placement under translation and rotation. Informatique Theorique et Applications/Theoretical Informatics and Applications, 23:5-28, 1989.



61. J.-D. Boissonnat. Shape reconstruction from planar cross-sections. Comput. Vision Graph. Image Process., 44:1-29, 1988. [WWW] Keyword(s): Delaunay triangulations.



62. J-D. Boissonnat. Complexité géométrique et robotique. In Techniques de la robotique, pages 293-348. Hermès, 1988.



63. J.-D. Boissonnat. Geometric structures for three-dimensional shape representation. ACM Transactions on Graphics, 3(4):266-286, 1984.



64. O. Faugeras, M. Hebert, P. Mussi, and J-D. Boissonnat. Polyhedral approximation of 3-D objects without holes. Computer Vision, Graphics, and Image Processing, 25:169-183, 1984.



65. Jean-Daniel Boissonnat. Stable matching between a hand structure and an object silhouette. IEEE Trans. on PAMI. Nov.1982, 4(6):603-612, 1982.

1. Jean-Daniel Boissonnat, Tamal K. Dey, and Clément Maria. The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology. In Proc. 21th European Symposium on Algorithms, LNCS, 2013. [WWW]



2. Jean-Daniel Boissonnat, Ramsay Dyer, and Arijit Ghosh. Stability of Delaunay-type structures for manifolds. In Proc. 28th ACM Symposium on Computational Geometry, 2012.



3. Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Steve Oudot. Equating the witness and restricted Delaunay complexes. In Abstracts 28th European Workshop on Computational Geometry, pages 17-20, 2012. [PDF]



4. Jean-Daniel Boissonnat and Clément Maria. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. In Proc. 20th European Symposium on Algorithms, volume 7074 of LNCS, 2012.



5. Omid Amini, Jean-Daniel Boissonnat, and Pooran Memari. Geometric tomography with topological guarantees. In Proc. 26th Annual Symposium on Computational Geometry, 2010. [WWW]



6. Jean-Daniel Boissonnat and Arijit Ghosh. Manifold reconstruction using Tangential Delaunay Complexes. In Proc. 26th Annual Symposium on Computational Geometry, 2010. [WWW]



7. Jean-Daniel Boissonnat, Olivier Devillers, and Samuel Hornus. Incremental construction of the Delaunay graph in medium dimension. In Proc. 25th Annual Symposium on Computational Geometry, pages 208-216, 2009. [WWW]



8. Dobrina Boltcheva, Mariette Yvinec, and Jean-Daniel Boissonnat. Mesh Generation from 3D Multi-material Images. In Medical Image Computing and Computer-Assisted Intervention, volume 5762 of Lecture Notes in Computer Science, pages 283-290, 2009. [WWW]



9. J.-D. Boissonnat, C. Wormser, and M. Yvinec. Locally uniform anisotropic meshing. In Proc. 24th Annual Symposium on Computational Geometry, pages 270-277, 2008. [WWW]



10. Jean-Daniel Boissonnat, Leo Guibas, and Steve Oudot. Manifold Reconstruction in Arbitrary Dimensions using Witness Complexes. In Proc. 23rd Annual Symposium on Computational Geometry, pages 194-203, 2007.



11. Jean-Daniel Boissonnat and Pooran Memari. Shape Reconstruction from Unorganized Cross-Sections. In Proc. 4th Annu. Sympos. Geometry Processing, pages 89-98, 2007.



12. Trung Nguyen, Jean-Daniel Boissonnat, Frédéric Falzon, and Christian Knauer. A Disk-Covering Problem with Application in Optical Interferometry. In Proc. 19th Canad. Conf. Comput. Geom., pages 173-176, 2007. [PDF]



13. Frank Nielsen, Jean-Daniel Boissonnat, and Richard Nock. On Bregman Voronoi Diagrams. In Proc. 18th ACM-SIAM Sympos. Discrete Algorithms, 2007.



14. Jean-Philippe Pons and Jean-Daniel Boissonnat. Delaunay deformable models: Topology-adaptive meshes based on the restricted Delaunay triangulation. In IEEE Conference on Computer Vision and Pattern Recognition CVPR 2007, 2007. [WWW]



15. Jean-Philippe Pons, Florent Ségonne, Jean-Daniel Boissonnat, Laurent Rineau, Mariette Yvinec, and Renaud Keriven. High-quality consistent meshing of multi-label datasets. In Information Processing in Medical Imaging, pages 198-210, 2007. [WWW]



16. Jean-Daniel Boissonnat and Steve Oudot. Provably Good Sampling and Meshing of Lipschitz Surfaces. In Proc. 22th Annual Symposium on Computational Geometry, 2006.



17. Trung Nguyen, Jean-Daniel Boissonnat, Philippe Blanc, Frederic Falzon, and Eric Thomas. Pupil Configuration for Extended Source Imaging with Optical Interferometry: A Computational Geometry Approach. In Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, 2006. [WWW]



18. Jean-Philippe Pons and Jean-Daniel Boissonnat. A Lagrangian Topology-Adaptive Dynamic Interfaces with a Lazy Kinetic Triangulation. In Proc. 3rd Annu. Sympos. Geometry Processing, 2006.



19. Jean-Daniel Boissonnat and Christophe Delage. Convex hulls and Voronoi diagrams of additively weighted points. In Proc. 13th European Symposium on Algorithms, volume 3669 of Lecture Notes Comput. Sci., pages 367-378, 2005. Springer-Verlag.



20. J.D. Boissonnat, L. Guibas, and S. Oudot. Surface learning by probing. In Proc. of the 21st Annual Symposium on Computational Geometry, pages 198-207, 2005.



21. Jean-Daniel Boissonnat, Camille Wormser, and Mariette Yvinec. Anisotropic Diagrams: Labelle Shewchuk approach revisited. In Proc. 17th Canad. Conf. Comput. Geom., pages 266-269, 2005.



22. Jean-Daniel Boissonnat, David Cohen-Steiner, and Gert Vegter. Isotopic Implicit Surface Meshing. In Proc. 36 th ACM Symp. on the Theory of Computing, pages 301-309, 2004.



23. Jean-Daniel Boissonnat and Steve Oudot. An Effective Condition for Sampling Surfaces with Guarantees. In Proc. ACM Symposium on Solid Modeling and Applications, 2004.



24. Dominique Attali, Jean-Daniel Boissonnat, and André Lieutier. Complexity of the Delaunay Triangulation of Points on Surfaces: The Smooth Case. In Proc. 19th Annual Symposium on Computational Geometry, pages 201-210, 2003. [WWW] [doi:10.1145/777792.777823]



25. Jean-Daniel Boissonnat and Menelaos Karavelas. On the combinatorial complexity of Euclidean Voronoi cells and convex hulls of d-dimensional spheres. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pages 305-312, 2003.



26. J. D. Boissonnat and S. Oudot. Provably good surface sampling and approximation. In Proc. 1st Annu. Sympos. Geometry Processing, pages 9-18, 2003.



27. Dominique Attali and Jean-Daniel Boissonnat. Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. In Proc. 7th ACM Symposium on Solid Modeling and Applications, 2002.



28. Sophie Balaven, Chakib Bennis, Jean-Daniel Boissonnat, and Mariette Yvinec. Conforming Orthogonal Meshes. In Proc. 11th International Meshing Roundtable., 2002. Keyword(s): Power diagram, hybrid meshes, orthogonal meshes.



29. J.D. Boissonnat, R. Chaine, P. Frey, G. Malandain, S. Salmon, E. Saltel, and M. Thiriet. From medical images to computational meshes. In Proceedings of Modelling & Simulation for Computer-aided Medicine and Surgery (MS4CMS), 2002.



30. Jean-Daniel Boissonnat and Julia Flötotto. A local coordinate system on a surface. In Proc. 7th ACM Symposium on Solid Modeling and Applications, 2002.



31. Grégoire Malandain and Jean-Daniel Boissonnat. Computing the Diameter of a Point Set. In Proc. Discrete Geometry for Computater Imagery, volume 2301 of Lecture Notes in Computer Science, pages 197-208, 2002. Springer-Verlag.



32. Ève Coste-Manière, Louaï Adhami, Renaud Severac-Bastide, Adrian Lobontiu, J. Kenneth Jr. Salisbury, Jean-Daniel Boissonnat, Nick Swarup, Gary Guthart, Élie Mousseaux, and Alain Carpentier. Optimized Port Placement for the Totally Endoscopic Coronary Artery Bypass Grafting using the da Vinci Robotic System. In D. Russ and S. Singh, editors, Lecture Notes in Control and Information Sciences, Experimental Robotics VII, volume 271, 2001. Springer. [PDF]



33. S. Balaven, C. Bennis, J-D. Boissonnat, and S. Sarda. Generation of hybrid grids using power diagrams. In Proc. Numerical Grid Generation in Field Simulations, 2000.



34. Jean-Daniel Boissonnat and Frédéric Cazals. Smooth surface reconstruction via natural neighbour interpolation of distance functions. In Proc. 16th Annual Symposium on Computational Geometry, pages 223-232, 2000.



35. Jean-Daniel Boissonnat, Frédéric Cazals, and Julia Flötotto. 2$D$-Structure Drawings of Similar Molecules. In Joe Marks, editor, Graph Drawing: 8th international symposium, volume 1984 of Lecture Notes in Computer Science, pages 115-126, 2000. Springer-Verlag.



36. Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, and Mariette Yvinec. Triangulations in CGAL. In Proc. 16th Annual Symposium on Computational Geometry, pages 11-18, 2000.



37. Jean-Daniel Boissonnat and Antoine Vigneron. An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments. In Proc. 8th Canad. Conf. Comput. Geom., 2000.



38. Jean-Daniel Boissonnat, Frédéric Cazals, Tran Kai Frank Da, Olivier Devillers, Sylvain Pion, François Rebufat, Monique Teillaud, and Mariette Yvinec. Programming with CGAL: The Example of Triangulations. In Proc the 15th Annual Symposium on Computational Geometry, pages 421-423, 1999. [WWW]



39. Jean-Daniel Boissonnat and Jack Snoeyink. Line and curve segment intersection with restricted predicates. In Proc. 15th Annual Symposium on Computational Geometry, pages 370-379, 1999.



40. J.-D. Boissonnat and S. Nullans. Reconstruction of 3D ``colored'' data. In Eurographics, pages 3.6, 1998.



41. J.-D. Boissonnat and S. Nullans. Reconstruction of 3D volumic models. In GOCAD ENSG Conference. 3D Modeling of natural objects: a challenge for the 2000's, 1998.



42. J-D. Boissonnat, E. de Lange, and M. Teillaud. Minkowski operations for satellite antenna layout. In Proc. 13th Annual Symposium on Computational Geometry, pages 67-76, 1997. [PDF]



43. J-D. Boissonnat, J. Czyzowicz, O. Devillers, J. Urrutia, and M. Yvinec. Computing Largest Circles Separating Two Sets of Segments. In Proc. 8th Canad. Conf. Comput. Geom., pages 173-178, 1996.



44. Jean-Daniel Boissonnat and Sylvain Lazard. A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles. In Proc. 12th Annual Symposium on Computational Geometry, pages 242-251, 1996.



45. J-D. Boissonnat and S. Lazard. Convex hulls of bounded curvature. In Proc. 8th Canad. Conf. Comput. Geom., pages 14-19, 1996.



46. J.-D. Boissonnat and S. Nullans. Reconstruction of Geological Structures from Heterogeneous and Sparse Data. In Proc. 4th ACM Workshop Adv. Geogr. Inform. Syst., 1996.



47. F. Avnaim, J.-D. Boissonnat, O. Devillers, F. P. Preparata, and M. Yvinec. Evaluation of a new method to compute signs of determinants. In Proc. of the 11th Annu. Symposium on Computational Geometry, pages C16-C17, 1995. [WWW]



48. J-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec. Circular Separability of Polygons. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, 1995.



49. J.-D. Boissonnat, K. Dobrindt, B. Geiger, and H. Michel. A global motion planner for a mobile robot on a terrain. In Communication at the 11th Annu. Sympos. Comput. Geom., pages C20-C21, 1995.



50. J.-D. Boissonnat and S. Lazard. Optimal path of bounded curvature passing through compulsory via-points. In Third PROMotion workshop on robot motion planning, 1995. Università La Sapienza, Roma.



51. J.-D. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec. Voronoi Diagrams in Higher Dimensions Under Certain Polyhedra Distance Functions. In Proc. 11th Annual Symposium on Computational Geometry, pages 79-88, 1995.



52. J-D. Boissonnat, J. Czyzowicz, O. Devillers, J-M. Robert, and M. Yvinec. Convex Tours of Bounded Curvature. In Proc. 2nd. European Symposiun on Algorithms, volume 855 of Lecture Notes in Computer Science, pages 254-265, 1994. Springer-Verlag.



53. Jean-Daniel Boissonnat, Olivier Devillers, and Sylvain Lazard. From Spiders Robots to Half Disks Robots. In Proc. 11th IEEE Internat. Conf. Robot. Autom., pages 953-958, 1994.



54. Jean-Daniel Boissonnat, Olivier Devillers, and Sylvain Lazard. Motion Planning of Legged Robots. In The First Workshop on the Algorithmic Foundations of Robotics, 1994. A. K. Peters, Boston, MA.



55. X-N. Bui, P. Souères, J-D. Boissonnat, and J-P. Laumond. Shortest path synthesis for Dubins non-holonomic robot. In Proc. 11th IEEE Internat. Conf. Robot. Autom., pages 2-7, 1994.



56. 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.



57. J-D. Boissonnat, O. Devillers, J. Duquesne, and M. Yvinec. Computing the whole set of Connolly Surfaces. In 12 th Annual Conference of the Molecular Graphics Society, 1993.



58. J-D. Boissonnat and B. Geiger. 3D simulation of delivery. In G. M. Nielson and D. Bergeron, editors, Visualization 93, San Jose CA, pages 416-419, 1993. IEEE Computer Society Press. [PDF]



59. J-D. Boissonnat and B. Geiger. Three dimensional reconstruction of complex shapes based on the Delaunay triangulation. In R. S. Acharya and D. B. Goldgof, editors, Biomedical Image Processing and Biomedical Visualization, volume 1905, pages 964-975, 1993. SPIE.



60. J-D. Boissonnat, A. Cérézo, O. Devillers, J. Duquesne, and M. Yvinec. An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension $d$. In Proc. 4th Canad. Conf. Comput. Geom., pages 269-273, 1992.



61. J-D. Boissonnat, A. Cérézo, and J. Duquesne. An Output-Sensitive Algorithm for Constructing the Convex Hull of a Set of Spheres. In IFIP Conference on Algorithms and efficient computation, 1992.



62. J-D. Boissonnat, A. Cérézo, and J. Leblond. Shortest paths of bounded curvature in the plane. In Proc. 9th IEEE Internat. Conf. Robotics and Automat., 1992.



63. J.-D. Boissonnat, O. Devillers, L. Donati, and F. P. Preparata. Motion planning for a spider robot. In Proc. 9th IEEE Internat. Conf. Robotics and Automat., pages 2321-2326, 1992. Keyword(s): motion plannig, legged robot.



64. J.-D. Boissonnat, O. Devillers, L. Donati, and F. P. Preparata. Stable placements of spider robots. In Proc. 8th Annual Symposium on Computational Geometry, pages 242-250, 1992. Keyword(s): motion plannig, legged robot.



65. J-D. Boissonnat, O. Devillers, and J. Duquesne. Computing Connolly Surfaces. In IFIP Conference on Algorithms and efficient computation, 1992.



66. J-D. Boissonnat, O. Devillers, and F. P. Preparata. Computing the Union of 3-Colored Triangles. In Proc. 15th IFIP Conf., volume 180 of Lecture Notes in Control and Information Science, pages 85-93, 1992. Springer-Verlag.



67. J-D. Boissonnat and K. Dobrindt. Randomized construction of the upper envelope of triangles in ${\rm I \! R}^3$. In Proc. 4th Canad. Conf. Comput. Geom., pages 311-315, 1992.



68. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. Output-sensitive construction of the $3$-d Delaunay triangulation of constrained sets of points. In Proc. 3rd Canad. Conf. Comput. Geom., pages 110-113, 1991. Keyword(s): Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography.



69. 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.



70. J.-D. Boissonnat, O. Devillers, and M. Teillaud. An on-line construction of higher-order Voronoi diagrams and its randomized analysis. In Proc. 2nd Canad. Conf. Comput. Geom., pages 278-281, 1990. Keyword(s): randomized algorithms, higher order Voronoi diagrams, dynamic algorithms.



71. P. Alevizos, J-D. Boissonnat, and M. Yvinec. Probing non convex polygons. In Proc. 6th IEEE Internat. Conf. Robotics and Automat., pages 202-208, 1989.



72. F. Avnaim and J. D. Boissonnat. Practical exact motion planning of a class of robots with three degrees of freedom. In Proc. 1st Canad. Conf. Comput. Geom., pages 19, 1989.



73. J.-D. Boissonnat and M. Yvinec. Probing a scene of non-convex polyhedra. In Proc. 5th Annual Symposium on Computational Geometry, pages 237-246, 1989.



74. F. Avnaim and J-D. Boissonnat. Polygon Placement under Translation and Rotation. In Proc. 5th Sympos. Theoret. Aspects Comput. Sci., volume 294 of Lecture Notes in Computer Science, pages 322-333, 1988. Springer-Verlag.



75. F. Avnaim, J-D. Boissonnat, and B. Faverjon. A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles. In Proc. 5th IEEE Internat. Conf. Robotics and Automat., pages 1656-1661, 1988.



76. P. Alevizos, J.-D. Boissonnat, and M. Yvinec. An optimal $O(n \log n)$ algorithm for contour reconstruction from rays. In Proc. 3rd Annual Symposium on Computational Geometry, pages 162-170, 1987.



77. F. Avnaim and J.-D. Boissonnat. Simultaneous containment of several polygons. In Proc. 3rd Annual Symposium on Computational Geometry, pages 242-250, 1987.



78. J.-D. Boissonnat and M. Teillaud. A hierarchical representation of objects: the Delaunay tree. In Proc. 2nd Annual Symposium on Computational Geometry, pages 260-268, 1986. [WWW]



79. J-D. Boissonnat. An Automatic Solid modeller for Robotics Applications. In International Symposium on Robotics Research, Gouvieux, 1985.



80. J.-D. Boissonnat. Reconstruction of solids. In Proc. 1st Annual Symposium on Computational Geometry, pages 46-54, 1985.



81. J.-D. Boissonnat and O. Faugeras. Triangulation of $3$-d objects. In Proc. 7th Internat. Joint Conf. Artif. Intell., pages 658-660, 1981.

1. Clément Jamin, Pierre Alliez, Mariette Yvinec, and Jean-Daniel Boissonnat. CGALmesh: a Generic Framework for Delaunay Mesh Generation. Research Report 8256, INRIA, 2013. [WWW] [PDF]



2. Jean-Daniel Boissonnat, Tamal K. Dey, and Clément Maria. A Space and Time Efficient Implementation for Computing Persistent Homology. Rapport de recherche 8195, December 2012. [WWW] [PDF]



3. Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Steve Oudot. Constructing intrinsic Delaunay triangulations of submanifolds. Research Report CGL-TR-26, European Commission, 2012. [WWW]



4. Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Steve Oudot. Delaunay-type structures for manifolds I: Stability. Research Report CGL-TR-25, European Commission, 2012. [WWW]



5. Jean-Daniel Boissonnat and Clément Maria. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. Research Report 7993, INRIA, 2012. [WWW] [PDF] Keyword(s): simplicial complexes, data structure, flag complexes, Rips complexes, witness complexes, relaxed witness complexes, high dimensions.



6. Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Steve Oudot. Equating the witness and restricted Delaunay complexes. Research Report CGL-TR-24, European Commission, 2011. [WWW]



7. Jean-Daniel Boissonnat and Arijit Ghosh. Manifold reconstruction using Tangential Delaunay Complexes. Research Report 7142, INRIA, 2011. Note: Version 2. [WWW]



8. Jean-Daniel Boissonnat and Arijit Ghosh. Triangulating Smooth Submanifolds with Light Scaffolding. Research Report 7660, INRIA, 2011. Note: Version 2. [WWW]



9. Jean-Daniel Boissonnat, Camille Wormser, and Mariette Yvinec. Anisotropic Delaunay Mesh Generation. Research Report 7712, INRIA, August 2011. [WWW] Keyword(s): mesh generation, anisotropic meshes, Delaunay triangulation.



10. Omid Amini, Jean-Daniel Boissonnat, and Pooran Memari. Geometric tomography with topological guarantees. Research Report 7147, INRIA, 2009. [WWW]



11. Samuel Hornus and Jean-Daniel Boissonnat. Efficient construction of the Delaunay triangulation in medium dimension. Research Report 6743, INRIA, 2008. [WWW]



12. Frank Nielsen, Jean-Daniel Boissonnat, and Richard Nock. Bregman Voronoi Diagrams: Properties, Algorithms and Applications. Research Report 6154, INRIA, 2007. [WWW]



13. Jean-Daniel Boissonnat, Camille Wormser, and Mariette Yvinec. Anisotropic Diagrams: Labelle Shewchuk approach revisited. Research Report 5741, INRIA, 2005. [WWW]



14. Jean-Daniel Boissonnat, Leonidas Guibas, and Steve Oudot. Learning surfaces by probing. Research Report 5434, INRIA, 2004. [WWW]



15. Jean-Daniel Boissonnat, David Cohen-Steiner, and Gert Vegter. Meshing implicit surfaces with certified topology. Research Report 4930, INRIA, 2003. Note: ECG-TR-244104-03. [WWW]



16. Jean-Daniel Boissonnat and Steve Oudot. An Effective Condition for Sampling Surfaces with Guarantees. Research Report 5064, INRIA, 2003. Note: ECG-TR-304100-02. [WWW]



17. Dominique Attali and Jean-Daniel Boissonnat. A Linear Bound on the Complexity of the Delaunay triangulation of points on polyhedral surfaces. Research Report 4453, INRIA, 2002. Note: ECG-TR-124100-01. [WWW]



18. Sophie Balaven, Chakib Bennis, Jean-Daniel Boissonnat, and Mariette Yvinec. Conforming Orthogonal Meshes. Research Report 4404, INRIA, 2002. [WWW]



19. Jean-Daniel Boissonnat and Julia Flötotto. A coordinate system on a surface: definition, properties and applications. Research Report 4530, INRIA, 2002. Note: ECG-TR-124300-03. [WWW]



20. Jean-Daniel Boissonnat and Menelaos Karavelas. On the combinatorial complexity of Euclidean Voronoi cells and convex hulls of d-dimensional spheres. Research Report 4504, INRIA, 2002. Note: ECG-TR-181104-01. [WWW]



21. Dominique Attali and Jean-Daniel Boissonnat. Complexity of the Delaunay triangulation of points on polyhedral surfaces. Research Report 4232, INRIA, 2001. [WWW]



22. Grégoire Malandain and Jean-Daniel Boissonnat. Computing the diameter of a point set. Research Report 4233, INRIA, 2001. [WWW]



23. Jean-Daniel Boissonnat and Frédéric Cazals. Natural Neighbour Coordinates of Points on a Surface. Research Report 4015, INRIA, 2000. [WWW]



24. Jean-Daniel Boissonnat and Frédéric Cazals. Smooth Surface Reconstruction via Natural Neighbour Interpolation of Distance Functions. Research Report 3985, INRIA, 2000. [WWW]



25. Jean-Daniel Boissonnat and Antoine Vigneron. An Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments. Research Report 3999, INRIA, 2000. [WWW]



26. Jean-Daniel Boissonnat and Antoine Vigneron. Elementary Algorithms for Reporting Intersections of Curve Segments. Research Report 3825, INRIA, 1999. [WWW]



27. Jean-Daniel Boissonnat, Olivier Devillers, and Sylvain Lazard. Motion planning of legged robots. Research Report 3214, INRIA, 1997. [WWW]



28. J.-D. Boissonnat, S. Ghosh, and S. Lazard. A linear time algorithm for computing a convex path of bounded curvature in a simple polygon. Technical Report TCS-97/1, Tata Institute of Fundamental Research, Bombay India, 1997.



29. J.-D. Boissonnat and F. P. Preparata. Robust Plane Sweep for Intersecting Segments. Research Report 3270, INRIA, 1997. [WWW]



30. J-D. Boissonnat and S. Lazard. A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles. Research Report 2887, INRIA, 1996. [WWW]



31. J.-D. Boissonnat and S. Nullans. Reconstruction of Geological Structures from Heterogeneous and Sparse Data. Research Report 3069, INRIA, 1996. [WWW]



32. J-D. Boissonnat, E. de Lange, and M. Teillaud. Minkowski operations for satellite antenna layout. Research Report 3070, INRIA, 1996. [WWW]



33. J-D. Boissonnat, J. Czyzowicz, O. Devillers, J. Urrutia, and M. Yvinec. Computing Largest Circles Separating Two Sets of Segments. Research Report 2705, INRIA, 1995. [WWW]



34. J.-D. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec. Voronoi Diagrams in Higher Dimensions Under Certain Polyhedral Distance Functions. Research Report 2629, INRIA, 1995. [WWW]



35. F. Avnaim, J-D. Boissonnat, O. Devillers, F. P. Preparata, and M. Yvinec. Evaluating signs of determinants using single-precision arithmetic. Research Report 2306, INRIA, 1994. [WWW]



36. J-D. Boissonnat and X-N. Bui. Accessibility Region for a Car that Only Moves Forwards along Optimal Paths. Research Report 2181, INRIA, 1994. [WWW]



37. J-D. Boissonnat, J. Czyzowicz, O. Devillers, J-M. Robert, and M. Yvinec. Convex Tours of Bounded Curvature. Research Report 2375, INRIA, 1994. [WWW]



38. J-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec. Circular Separability of Polygons. Research Report 2406, INRIA, 1994. [WWW]



39. J.-D. Boissonnat, A. Cérézo, and J. Leblond. A note on shortest paths in the plane subject to a constraint on the derivative of the curvature. Research Report 2160, INRIA, 1994. [WWW]



40. J-D. Boissonnat, A. Cérézo, O. Devillers, J. Duquesne, and M. Yvinec. An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension $d$. Research Report 2080, INRIA, 1993. [WWW]



41. J-D. Boissonnat and K. Dobrindt. Randomized construction of the upper envelope of surface patches in three dimensions. Research Report 1878, INRIA, 1993. [WWW]



42. X-N. Bui, P. Souères, J-D. Boissonnat, and J-P. Laumond. The shortest Paths Synthesis for Nonholonomic Robots Moving Forwards. Research Report 2153, INRIA, 1993. [WWW]



43. J.-D. Boissonnat, O. Devillers, L. Donati, and F. P. Preparata. Motion planning for a spider robot. Research Report 1767, INRIA, 1992. [WWW] Keyword(s): motion plannig, legged robot.



44. J-D. Boissonnat and B. Geiger. Three-dimensional reconstruction of complex shapes based on the Delaunay triangulation. Research Report 1697, INRIA, 1992. [WWW] Keyword(s): shape reconstruction, medical images, Delaunay triangulation.



45. J.-D. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud. Output-sensitive construction of the $3$-d Delaunay triangulation of constrained sets of points. Research Report 1415, INRIA, 1991. [WWW] Keyword(s): Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography.



46. J-D. Boissonnat, A. Cérézo, and J. Leblond. Shortest paths of bounded curvature in the plane. Research Report 1503, INRIA, 1991. [WWW]



47. J-D. Boissonnat, O. Devillers, and F. P. Preparata. Union of 3-colored triangles. Research Report 1293, INRIA, 1990. [WWW]



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



49. J.-D. Boissonnat, O. Devillers, and M. Teillaud. A dynamic construction of higher-order Voronoi diagrams and its randomized analysis. Research Report 1207, INRIA, 1990. [WWW] Keyword(s): randomized algorithms, higher order Voronoi diagrams, dynamic algorithms.



50. J-D. Boissonnat and M. Teillaud. On the Randomized Construction of the Delaunay Tree. Research Report 1140, INRIA, 1989. [WWW] Keyword(s): randomized algorithms, Delaunay triangulation, semi-dynamic algorithms.



51. J-D. Boissonnat and M. Yvinec. Probing a scene of non convex polyhedra. Research Report 1110, INRIA, 1989. [WWW]



52. P. Alevizos, J.-D. Boissonnat, and F. Preparata. On the boundary of a union of rays. Technical report 896, INRIA, 1988. [WWW]



53. P. Alevizos, J.-D. Boissonnat, and M. Yvinec. On the order induced by a set of rays. Application to the probing of non convex polygons. Technical report 927, INRIA, 1988. [WWW]



54. F. Avnaim and J.-D. Boissonnat. Polygon placement under translation and rotation. Technical report 889, INRIA, 1988. [WWW]



55. F. Avnaim, B. Faverjon, and J.-D. Boissonnat. A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles. Technical report 890, INRIA, 1988. [WWW]



56. J.-D. Boissonnat and F. Preparata. On the external boundary of a union of rays. Technical report 705, INRIA, 1988. [WWW]



57. F. Avnaim and J.-D. Boissonnat. Placement simultane en translation. Technical report 689, INRIA, 1987. [WWW]

1. S. Balaven, J-D. Boissonnat, C. Bennis, and S. Sarda. Method of generating a grid on a heterogenous formation crossed by one or more geometric discontinuities in order to carry out simulations, 2005. Note: United States Patent 7,047,165. Assignee Institut Français du Pétrole.



2. Jean-Daniel Boissonnat. Reconstruire des surfaces pour l'imagerie, 2005. Note: Interstices web site, http://www.interstices.info/voronoi. [WWW]



3. B. Geiger and J-D. Boissonnat. Method and apparatus for fast automatic centerline extraction for virtual endoscopy, 2005. Note: United States Patent Application, 20050033114. Assignee Siemens Corporation.



4. Étienne Parizot and Jean-Daniel Boissonnat. Manipulation informatique des objets géométriques, 2005. Note: Interstices web site, http://www.interstices.info/objets-geometriques. [WWW]



5. Ève Coste-Manière, L. Adhami, J-D. Boissonnat, A. Carpentier, and G. Guthart. Methods and apparatus for planning robotic surgery, 2003. Note: United States Patent Application, 20030109780. Assignee INRIA and Intuitive Surgical.



6. Louaï Adhami, Ève Coste-Manière, and Jean-Daniel Boissonnat. Planning and Simulation of Minimally Invasive Surgery using Tele-Operated Manipulators. Workshop on Medical Robotics, 10th International Conference on Advanced Robotics, 2001. [WWW]



7. Jean-Daniel Boissonnat, Frédéric Cazals, and Stéphane Nullans. Smooth shape reconstruction, 1999. Note: 15th European Workshop Comput. Geom. pp. 63--68.



8. J.-D. Boissonnat. Robustesse des algorithmes géométriques, 1998. Note: Cours aux Journées de Géométrie Algorithmique \citeprisme-t-jga-98. [WWW]

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