Jean-Daniel Boissonnat
Collège de France
Informatique et sciences numériques (2016-2017)
Géométrie algorithmique : données, modèles, programmes

Bibliographie

    F. Aurenhammer, R. Klein, D-T. Lee. Voronoi diagrams and Delaunay triangulations. World Scientific (2013)
    J-D. Boissonnat, F. Chazal, M. Yvinec. Geometric and Topological Inference. Cambridge University Press (2017)
    J-D. Boissonnat, M. Teillaud ed. Effective Computational Geometry for Curves and Surfaces. Springer (2007)
    J-D. Boissonnat, M. Yvinec. Algorithmic Geometry. Cambridge University Press (1998)
    S-W. Cheng, T. K. Dey, J. R. Shewchuk. Delaunay Mesh Generation. CRC Press (2013)
    T. K. Dey. Curve and Surface Reconstruction : Algorithms with Mathematical Analysis. Cambridge University Press (2007)
    H. Edelsbrunner, J. L. Harer. Computational topology : an introduction. American Mathematical Soc. (2010)
    R. Ghrist. Elementary applied topology. (2014)
    Har-Peled, Sariel. Geometric approximation algorithms. American Mathematical Society Vol. 173 (2011)
    R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press (1995)
    S. Y. Oudot. Persistence Theory: From Quiver Representations to Data Analysis. AMS Mathematical Surveys and Monographs, Vol. 209 (2015). 1