INRIA post-doctoral positions

[Monique Teillaud]

The INRIA campaign for post-doctoral positions will start soon
http://www.inria.fr/travailler/opportunites/postdoc.en.html

The topics proposed at INRIA Sophia Antipolis are already accessible:
http://www-sop.inria.fr/act_recherche/formation/offres_de_post-doc_sur_sophia_en.shtml

Sylvain Pion and myself have proposed a topic
"Complex objects handling in Computational Geometry"

Potential candidates are invited to contact us by e-mail
Monique.Teillaud at sophia.inria.fr
Sylvain.Pion at sophia.inria.fr

---------------------------------------------------------------
There is a recent trend in Computational Geometry aiming at extending 
algorithms, which are designed mostly for simple objects (points, linear 
objects), to more complex objects, e.g. algebraic curves and surfaces. 
This requires some research to be done in several directions.
One of the questions is the representation of the objects, in particular 
unbounded objects. Projective geometry could help solving this issue, 
and one aspect of the research could be the development of algorithms 
well suited to the projective space, followed by the design and 
implementation of a kernel of projective geometry primitives to the CGAL 
library. Let us also mention the potential impact of such a work in the 
field of computer vision.

On the algorithmic side, we are planning to focus on 3D sweeping 
algorithms, for instance for computing arrangements of surfaces. In 
particular we are interested in studying the way the general Kinetic 
Data Structures framework allows to unify sweeping algorithms. This 
research direction will involve the axiomatization of the algorithms and 
algebraic tools for the detection and manipulation of events.
One of the other aspects of the research will be related to arithmetic 
and filtering techniques to ensure both robustness and efficiency. On 
the practical side, our final goal is to get both efficient and robust 
implementations in the Computational Geometry Algorithms Library CGAL 
(Open Source Project www.cgal.org), to ensure an important dissemination 
of this research.
---------------------------------------------------------------

See also another topic proposed by Pierre Alliez
"Mesh correspondence and compatible remeshing for simulation and animation"
Pierre.Alliez at sophia.inria.fr

---------------------------------------------------------------
One research topic of the project-team GEOMETRICA is approximation and 
remeshing of 3D shapes. Efficient representations for animated or 
deformed shapes has however been little explored until now, although 
they are of undeniable importance both for simulation and multimedia. 
The research topic to be investigated during this post-doc is dealing 
with research of mesh correspondences (partial or global) between 
several shapes in order to generate compatible meshes, i.e. a new set of 
meshes which are remeshes of the input set, such that they have a common 
connectivity structure, well-shaped polygons, approximate well the 
input, and respect the correspondence. We will also investigate dynamic 
meshing techniques, where the connectivity can evolve across time. The 
goal is to invent new meshing algorithms for simulation as well as new 
tools for interactive generation and processing of animations for 
multimedia content creation. The computational geometry algorithms 
library CGAL will be used for experiments and validation.
---------------------------------------------------------------

	Monique Teillaud

-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.