Accepted papers

• Locked Thick Chains

  Computational Geometry: Theory and Applications, to appear
  joint work with Erik D. Demain, Martin L. Demaine and Stefan Langerman
  25th European Workshop on Computational Geometry (EuroCG'09)

Master's Thesis (MA1 - MA2)

My master's thesis deal with thick chains. In general we consider chains with no thickness and an amount of works have been realised in this vision. My master's thesis considers the same chains but with a thickness parameter.

This is a video made from Blender 3D of a motion over a polygonal thick chain (I am trying to work with this software, so the result is not perfect).

Personal work(s)

Projet de recherche et communication scientifique de BA3 (INFO3)

"Algorithmiques en Bioinformatique : L'analyse de séquences d'ADN", personal work for my third year. This work deals with some algorithms use to analyse DNA sequences. For accessibility reasons, this work do not enter in the details of this algorithms and offers juste a introduction to this technics.

Download this (.pdf format in French)

Projet de Géométrie Algorithmique (MA1)

Folding and Unfolding of Polyhedra. The Alexandrov's theorem give us conditions to correctly fold a polygon in a convex polyhedra. With edge-to-edge condition, we have a dynamic algorithm which determine if a edge-to-edge polygon folding exists.