Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Star domain

Related publications (11)

Dynamical system approach to navigation around obstacles

Aude Billard, Aradhana Nayak

In this article, we propose a dynamical system to avoid obstacles which are star shaped and simultaneously converge to a goal. The convergence is almost-global in a domain and the stationary points are identified explicitly. Our approach is based on the id ...

2024

Quadratic serendipity element shape functions on general planar polygons

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

Discrete-time regional pole-placement using convex approximations: Theory and application to a boost converter

Emilio Maddalena

The problem of allocating the closed-loop poles of linear systems in specific regions of the complex plane defined by discrete time-domain requirements is addressed. The resulting non-convex set is inner-approximated by a convex region described with linea ...

2019

Grammar-based generation of trusses within non-convex domains

Corentin Jean Dominique Fivet, Ioannis Mirtsopoulos

A force-driven generative grammar rule is proposed as a design exploration method for planar networks in static equilibrium within non-convex domains. The aim is to enrich the catalog of unconventional structural typologies. Empty or partial networks in eq ...

fib2019

A Least-Squares/Relaxation Method for the Numerical Solution of the Three-Dimensional Elliptic Monge-Ampere Equation

Alexandre Caboussat, Dimitrios Gourzoulidis

In this article, we address the numerical solution of the Dirichlet problem for the three-dimensional elliptic Monge-Ampere equation using a least-squares/relaxation approach. The relaxation algorithm allows the decoupling of the differential operators fro ...

SPRINGER/PLENUM PUBLISHERS2018

Mechanical analyses of the waveguide flange coupling for the first confinement system of the ITER electron cyclotron upper launcher

Timothy Goodman, René Chavan, Jean-Daniel Landis, Robert Bertizzolo

The four electron cyclotron (EC) upper port antennas (or "upper launchers" -UL) will be used to drive current locally inside magnetic islands located at the q= 2 (or smaller) rational surfaces in order to stabilize neoclassical tearing modes (NTMs), as wel ...

Elsevier Science Sa2016

Waldhausen K-theory of spaces via comodules

Kathryn Hess Bellwald

Let X be a simplicial set. We construct a novel adjunction be- tween the categories RX of retractive spaces over X and ComodX+ of X+- comodules, then apply recent work on left-induced model category structures [5], [16] to establish the existence of a left ...

Academic Press Inc Elsevier Science2016

Opaque Sets

János Pach

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

Springer2014

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

Harmonic symmetrization of convex sets and of Finsler structures, with applications to Hilbert geometry

Marc Troyanov

David Hilbert discovered in 1895 an important metric that is canonically associated to any convex domain

\Omega

in the Euclidean (or projective) space. This metric is known to be Finslerian, and the usual proof assumes a certain degree of smoothness of t ...

2009

Inclusions différentielles et problèmes variationnels

Ana Margarida Fernandes Ribeiro

In this thesis we deal with three different but connected questions. Firstly (cf. Chapter 2) we make a systematic study of the generalized notions of convexity for sets. We study the notions of polyconvex, quasiconvex and rank one convex set. We remark tha ...

EPFL2006