Our research is focused on the two followings themes.
Simple algebraic surfaces cover a variety of forms sufficient for
representing the majority of objects encountered in the fields of
design, architecture and industrial manufacturing.
important, then, to be able to process these surfaces in a robust and
In comparison with polygonal representations, modeling and
manipulating scenes made of curved objects pose a large variety of new
issues and require entirely different tools.
In the context of exact geometric computing, we work on key problems involving curved objects, mainly two-dimensional curves, and low-degree three-dimensional surfaces such as quadrics.
|The notion of 3D visibility plays a fundamental role in computer graphics. In this field, the determination of objects visible from a given point, the extraction of shadows or of penumbra boundaries are examples of visibility computations. In global illumination methods, (e.g. radiosity algorithms), it is necessary to determine, in a very repetitive manner, if two points of a scene are mutually visible. The computations can be excessively expensive. For instance, in radiosity, it is not unusual that 50 to 70% of the simulation time is spent answering visibility queries.|