Concept

Tangente (géométrie)

Publications associées (42)

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

2024

Avoidance of Concave Obstacles Through Rotation of Nonlinear Dynamics

Aude Billard, Lukas Huber

Controlling complex tasks in robotic systems, such as circular motion for cleaning or following curvy lines, can be dealt with using nonlinear vector fields. This article introduces a novel approach called the rotational obstacle avoidance method (ROAM) fo ...

Piscataway2024

Grassmannian diffusion maps based surrogate modeling via geometric harmonics

A novel surrogate model based on the Grassmannian diffusion maps (GDMaps) and utilizing geometric harmonics (GH) is developed for predicting the response of complex physical phenomena. The method utilizes GDMaps to obtain a low-dimensional representation o ...

2022

Rank-adaptive structure-preserving model order reduction of Hamiltonian systems

Jan Sickmann Hesthaven, Nicolò Ripamonti, Cecilia Pagliantini

This work proposes an adaptive structure-preserving model order reduction method for finite-dimensional parametrized Hamiltonian systems modeling non-dissipative phenomena. To overcome the slowly decaying Kolmogorov width typical of transport problems, the ...

EDP SCIENCES S A2022

An Accelerated First-Order Method for Non-convex Optimization on Manifolds

Nicolas Boumal, Christopher Arnold Criscitiello

We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical ...

SPRINGER2022

Development of a new method to determine the axial void velocity profile in BWRs from measurements of the in-core neutron noise

Mathieu Hursin

Determination of the local void fraction in BWRs from in-core neutron noise measurements requires the knowledge of the axial velocity of the void. The purpose of this paper is to revisit the problem of determining the axial void velocity profile from the t ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Symplectic dynamical low rank approximation of wave equations with random parameters

Fabio Nobile, Eleonora Musharbash, Eva Vidlicková

In this paper we propose a dynamical low-rank strategy for the approximation of second order wave equations with random parameters. The governing equation is rewritten in Hamiltonian form and the approximate solution is expanded over a set of 2S dynamical ...

2020

A Study of Several Artificial Viscosity Models within the Discontinuous Galerkin Framework

Jan Sickmann Hesthaven

Dealing with strong shocks while retaining low numerical dissipation traditionally has been one of the major challenges for high order methods like discontinuous Galerkin (DG). In the literature, shock capturing models have been designed for DG based on va ...

GLOBAL SCIENCE PRESS2020

Benchmarking of the plane-to-plane metric

Touradj Ebrahimi, Evangelos Alexiou

In this report we benchmark the plane-to-plane objective quality metric. This is, a metric that measures the angular similarity of tangent planes between two point cloud models and relies on normal vectors that are carried with associated pairs of points. ...

2020

Dynamical Reduced Basis Methods for Hamiltonian Systems

Cecilia Pagliantini

We consider model order reduction of parameterized Hamiltonian systems describing nondissipative phenomena, like wave-type and transport dominated problems. The development of reduced basis methods for such models is challenged by two main factors: the ric ...

2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search