Concept

Ligne polygonale

Publications associées (27)

Discontinuous Galerkin methods for Fisher-Kolmogorov equation with application to a-synuclein spreading in Parkinson's disease

This spreading of prion proteins is at the basis of brain neurodegeneration. This paper deals with the numerical modelling of the misfolding process of a-synuclein in Parkinson's disease. We introduce and analyse a discontinuous Galerkin method for the sem ...

Lausanne2023

Flexural-tensegrity snapping tails for bio-inspired propulsion in fluids

Pedro Miguel Nunes Pereira de Almeida Reis, Claudio Boni

Many aquatic animals propel themselves by flapping their tails. Leveraging a recently proposed snapping cantilever beam based on the concept of flexural tensegrity, we propose a bio-inspired propulsion device. The design comprises a segmental beam with hol ...

ELSEVIER2022

Robust numerical integration on curved polyhedra based on folded decompositions

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces correspond to the g ...

ELSEVIER SCIENCE SA2022

On Linear Interpolation in the Latent Space of Deep Generative Models

Quentin Christian Becker, Mike Yan Michelis

The underlying geometrical structure of the latent space in deep generative models is in most cases not Euclidean, which may lead to biases when comparing interpolation capabilities of two models. Smoothness and plausibility of linear interpolations in lat ...

2021

Approximating the rectilinear crossing number

János Pach

A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane and to each edge a straight-line segment connecting the corresponding two points. The rectilinear crossing number of a graph G, (cr) over bar (G), is the mi ...

2019

Superpixels and Polygons using Simple Non-Iterative Clustering

Sabine Süsstrunk, Radhakrishna Achanta

We present an improved version of the Simple Linear Iterative Clustering (SLIC) superpixel segmentation. Unlike SLIC, our algorithm is non-iterative, enforces connectivity from the start, requires lesser memory, and is faster. Relying on the superpixel bou ...

Ieee2017

Generating Calligraphic Trajectories with Model Predictive Control

Sylvain Calinon

We describe a methodology for the interactive definition of curves and motion paths using a stochastic formulation of optimal control. We demonstrate how the same optimization framework can be used in different ways to generate curves and traces that are g ...

2017

Simple topological graphs

Andres Jacinto Ruiz Vargas

This thesis is devoted to the understanding of topological graphs. We consider the following four problems: 1. A \emph{simple topological graph} is a graph drawn in the plane so that its edges are represented by continuous arcs with the property that any t ...

EPFL2016

Empty Triangles in Complete Topological Graphs

Andres Jacinto Ruiz Vargas

A simple topological graph is a graph drawn in the plane so that its edges are represented by continuous arcs with the property that any two of them meet at most once. Let be a complete simple topological graph on vertices. The three edges induced by any t ...

Springer2015

Decentralized Self-Selection of Swarm Trajectories: From Dynamical Systems to Robotic Implementation

Francesco Mondada, Max-Olivier Hongler, Guillaume Adrien Sartoretti, Marcelo Elias de Oliveira

In this paper, we present a distributed control strategy, enabling agents to converge onto and travel along a consensually selected curve among a class of closed planar curves. Individual agents identify the number of neighbors within a finite circular sen ...

Springer Verlag2014

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