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.
This paper presents a derivation and a physical interpretation of the equal area rule (EAR) for wire-grid simulation of surfaces. We propose a new procedure that leads to a formulation for obtaining the radii for an arbitrarily meshed surface. A simple com ...
Dynamic mesh adaptation on unstructured grids, by localised refinement and derefinement, is a very efficient tool for enhancing solution accuracy and optimise computational time. One of the major drawbacks however resides in the projection of the new nodes ...
A multiphase-field model for the description of coalescence in a binary alloy is solved numerically using adaptive finite elements with high aspect ratio. The unknown of the multiphase-field model are the three phase fields (solid phase 1, solid phase 2, 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 ...
This course is designed to cover the entire geometry processing pipeline based on triangle meshes. We will present the latest concepts for mesh generation and mesh repair, for geometry and topology optimizations like mesh smoothing, decimation, and remeshi ...
We derive a nonlinear stabilized Galerkin approximation of the Laplace operator for which we prove a discrete maximum principle on arbitrary meshes and for arbitrary space dimension without resorting to the well-known acute condition or generalizations the ...
In this article we analyze a subdomain residual error estimator for finite element approximations of elliptic problems. It is obtained by solving local problems on patches of elements in weighted spaces and provides an upper bound on the energy norm of the ...
Reconstruction algorithms for Optical Diffuse Tomography (ODT) rely heavily on fast and accurate forward models. Arbitrary geometries and boundary conditions need to be handled rigorously since they are the only input to the inverse problem. From this pers ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
Reconstruction algorithms for Optical Diffuse Tomography (ODT) rely heavily on fast and accurate forward models. Arbitrary geometries and boundary conditions need to be handled rigorously since they are the only input to the inverse problem. From this pers ...
We develop a discretisation and solution technique for elliptic problems whose solutions may present strong variations, singularities, boundary layers and oscillations in localised regions. We start with a coarse finite element discretisation with a mesh s ...
