Publications associées à Ligne polygonale

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 ...

Elsevier Science Sa2023

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

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

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Moric

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...

Springer Japan2013

Erdos-Szekeres-type theorems for monotone paths and convex bodies

János Pach

For any sequence of positive integers j(1)< j(2)= 2 and q >= 2, what is the s ...

London Math Soc2012

Can One Hear the Shape of a Room: The 2–D Polygonal Case

Martin Vetterli, Yue Lu, Ivan Dokmanic

We consider the problem of estimating room geometry from the acoustic room impulse response (RIR). Existing approaches addressing this problem exploit the knowledge of multiple RIRs. In contrast, we are interested in reconstructing the room geometry from a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Hanani-Tutte and Monotone Drawings

Radoslav Fulek

A drawing of a graph is x-monotone if every edge intersects every vertical line at most once and every vertical line contains at most one vertex. Pach and Toth showed that if a graph has an x-monotone drawing in which every pair of edges crosses an even nu ...

Springer-Verlag Berlin2011

Adjacent Crossings Do Matter

Radoslav Fulek

In a drawing of a graph, two edges form an odd pair if they cross each other an odd number of times. A pair of edges is independent if they share no endpoint. For a graph G, let ocr(G) be the smallest number of odd pairs in a drawing of G and let iocr(G) b ...

Springer-Verlag Berlin2011