Current Position
Professor Assistant (Maître de Conférences) in University of Clermont I
Laboratory: LAIC laboratory - IUT Clermont-Ferrand - Aubière - France
e-mail: for misleading e-mail spiders
: gerard@laic.u-clermont0.fr and for you, just
replace the 0 by a 1 since my correct adress is with a 1.
Discrete
Tomography , Recognition of Digital Primitives, Reconstruction of Surfaces,
Digital and Computational Geometry, Linear Programming and LP-duality...
Member of Workgroup of
Discrete Geometry (GeoDis)
of GdR-IM and of International Association for
Pattern Recognition (IAPR).
Papers
[1] Y. Gerard. Analyse locale des droites discrètes. généralisation et applications à la connexité des plans discrets. Comptes Rendus de l’Académie des Sciences, 324(I) :1419–1424, 1997.
[2] Y. Gerard. Contribution à la géométrie discrète. PhD thesis, Université d’Auvergne, 1999.
[3] Y. Gerard. Local configurations of digital hyperplanes. In Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery, volume 1568 of Lecture Notes in Computer Science, pages 65–75, 1999.
[4] Y. Gerard. A question of digital linear algebra. In Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery, volume 1953 of Lecture Notes in Computer Science, pages 126–136, 2000.
[5] S. Brunetti, A. Del Lungo, and Y. Gerard. On the computational complexity of reconstructing three-dimensional lattice sets from their two dimensional x-rays. Journal of Linear Algebra and Applications, 339(1-3) :59–73, 2001.
[6] D. Coeurjolly, L. Tougne, J.P. Reveillès, and Y. Gerard. An elementary algorithm for digital arc segmentation. In 8th International Workshop on Combinatorial Image Analysis, volume 46 of Electronic Notes in Theoretical Computer Science, 2001.
[7] A. Daurat, Y. Gerard, and M. Nivat. The chords’ problem. Theoretical Computer Science, 282(2) :319–336, 2002.
[8] Y. Gerard. Periodic graphs and connectivity of the rational digital hyperplanes. Theoretical Computer Science, 283(1) :171–182, 2002.
[9] Y. Gerard. A fast and elementary algorithm for digital plane recognition. In 9th International Workshop on Combinatorial Image Analysis, volume 12 of Electronic Notes in Discrete Mathematics, 2003. Proceedings of IWCIA03 (International Workshop on Combinatorial Image).
[10] D. Coeurjolly, L. Tougne, J.P. Reveillès, and Y. Gerard. An elementary algorithm for digital arc segmentation. Discrete Applied Mathematics, 139(1-3) :31–50, 2004.
[11] F. Feschet and Y. Gerard. Computerized tomography with digital lines and linear programming. In Proceedings of the 12th International Conference on Discrete Geometry for Computer Imagery, volume 3429 of Lecture Notes in Computer Science, pages 126–135, 2005.
[12] Y. Gerard. Reduction from three-dimensional discrete tomography to multicommodity flow problem. Theoretical Computer Science, 346(2-3) :300–306, 2005.
[13] Y. Gerard and F. Feschet. Application of a discrete tomography algorithm to computerized tomography. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, pages 501–517, 2005.
[14] Y. Gerard, I. Debled-Rennesson, and P. Zimmermann. An elementary digital plane recognition algorithm. Discrete Applied Mathematics, 151(1-3) :169–183, 2005.
[15] A. Daurat, Y. Gerard, and M. Nivat. Some necessary clarifications about the Chords’ Problem and the Partial Digest Problem. Theoretical Computer Science, 347(1-2) :432–436, 2005.
[16] Y. Gérard. Additive Subsets. In Proceedings of the 12th International Workshop of Combinatorial Image Analysis, volume 4040 of Lecture Notes in Computer Science, pages 347–353, 2006.
[17] T. Marzais, Y. Gérard, R. Malgouyres. LP fitting approach for reconstructing parametric surfaces from points clouds. In Proceedings of the First International Conference on Computer Graphics Theory and Applications, pages 325-330, 2006.
[18] Y. Gerard, and F. Feschet. Application of a discrete tomography approach to computerized tomography. In A. Kuba and G.T. Herman, editors, Advance in Discrete Tomography and its Applications, Birkhäuser, Boston, 2007.
[19] Y. Gerard. Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums is NP-hard. In Proceedings of the 14th International Conference on Discrete Geometry for Computer Imagery, volume 4992 of Lecture Notes in Computer Science, pages 363-371, 2008.
[20] Y. Gerard, Fabien Feschet, David Coeurjolly. Gift-Wrapping Based Preimage Computation Algorithm. In Proceedings of the International Workshop on Cominatorial Image Analysisy, volume 4958 of Lecture Notes in Computer Science, pages 310-321, 2008.