Publication

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

Publications associées (12)

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

Quadratic serendipity element shape functions on general planar polygons

Juan Cao, Xiaodong Wei

This paper proposes a method for the construction of quadratic serendipity element (QSE) shape functions on planar convex and concave polygons. Existing approaches for constructing QSE shape functions are linear combinations of the pair-wise products of ge ...

ELSEVIER SCIENCE SA2022

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

Geometric multiscale modeling of the cardiovascular system, between theory and practice

Alfio Quarteroni, Christian Vergara

This review paper addresses the so called geometric multiscale approach for the numerical simulation of blood flow problems, from its origin (that we can collocate in the second half of '90s) to our days. By this approach the blood fluid-dynamics in the wh ...

Elsevier2016

A Location-Privacy Threat Stemming from the Use of Shared Public IP Addresses

Jean-Pierre Hubaux, Nevena Vratonjic, Vincent Bindschaedler, Kévin Clément Huguenin

This paper presents a concrete and widespread example of situation where a user’s location privacy is unintentionally compromised by others, specifically the location-privacy threat that exists at access points (public hotspots, FON, home routers, etc.) th ...

Ieee Computer Soc2014

On Polygons Excluding Point Sets

Radoslav Fulek, Filip Moric, Balázs Keszegh

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

Small distances in convex polygons

Filip Moric

Let d(1) < d(2) < ... denote the set of all distances between two vertices of a convex n-gon. We show that the number of pairs of vertices at distance d(2) from one another is at most n + O(1). (C) 2013 Elsevier B.V. All rights reserved. ...

Elsevier2013

Fourier Approximation Of Symmetric Ideal Knots

Mathias Carlen, Henryk Gerlach

Enforcing a specific symmetry group on a curve, knotted or not, is not trivial using standard interpolations such as polygons or splines. For a prescribed symmetry group we present a symmetrization process based on a Fourier description of a knot. The pres ...

2012

Obtaining Binaural Room Impulse Responses from B-Format Impulse Responses Using Frequency-Dependent Coherence Matching

Fritz Menzer, Christof Faller, Hervé Lissek

Measuring binaural room impulse responses (BRIRs) for different rooms and different persons is a costly and time-consuming task. In this paper, we propose a method that allows to compute BRIRs from a B-format room impulse response (B-format RIR) and a set ...

Institute of Electrical and Electronics Engineers2011

Indecomposable Coverings with Concave Polygons

Doemoetoer Palvoelgyi

We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold covering of some point set by the translates of this polygon that cannot be decomposed into two coverings. Moreover, we give a complete classification of open ...

Springer-Verlag2010

Convex polygons are cover-decomposable

Doemoetoer Palvoelgyi

We show that for any open convex polygon P, there is a constant k(P) such that any k(P)-fold covering of the plane with translates of P can be decomposed into two coverings. ...

2010

Application of 3D range camera in virtual human-computer interfaces

Huan Du

In this work, we propose new ways to employ 3D-ranging systems in advanced human-computer interfaces and show that they can be used for precise hand-tracking systems aiming at virtual keyboard or mouse applications. We first implement a Structured Light (S ...

EPFL2008