Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Deformable 3--D models are used extensively in Computer Graphics and Computer Vision for Visualization, Animation and Modeling. They can be represented either as traditional explicit surfaces, such as triangulated meshes, or as implicit surfaces. Explicit ...
We investigate some domain decomposition techniques to solve large scale aerodynamics problems on unstructured grids. Where implicit time advancing scheme are used, a large sparse linear system have to be solved at each step. To obtain good scalability and ...
This paper proposes a method to embed information into a 3D model represented by a polygonal mesh. The approach used consists in slightly changing the position of the vertices, in uencing the length of approximation of the normals to the surface. This tech ...
Meshes with (recursive) subdivision connectivity, such as subdivision surfaces, are increasingly popular in computer graphics. They present several advantages over their Delaunay-type based counterparts, e.g., Triangulated Irregular Networks (TINs), such a ...
A numerical method is proposed to evaluate gradients on non-uniform, non-orthogonal, three-dimensional structured meshes of hexahedra, as commonly used by finite volume methods. The method uses isoparametric transforms on tetrahedra to evaluate the gradien ...
This course introduces points as a powerful and versatile graphics primitive. Speakers present their latest concepts for the acquisition, representation, modeling, processing, and rendering of point sampled geometry along with applications and research dir ...
During the last 20 years, the joint expansion of computing power, computer graphics, networking capabilities and multiresolution analysis have stimulated several research domains, and developed the need for new types of data such as 3D models, i.e. discret ...
We present a new scheme for digital watermarking of point-sampled geometry based on spectral analysis. By extending existing algorithms designed for polygonal data to unstructured point clouds, our method is particularly suited for scanned models, where th ...
Meshes with (recursive) subdivision connectivity, such as subdivision surfaces, are increasingly popular in computer graphics. They present several advantages over their Delaunay-type based counterparts, e.g., Triangulated Irregular Networks (TINs), such a ...
This paper presents a high-capacity method to embed information into the geometry of a 3D polygonal mesh. The method extends a previously reported work, to which several improvements have been brought. By construction, the new embedding algorithm is robust ...
