Concept

Simple polygon

Related publications (25)

Monopoly Pricing with Unknown Demand

The optimal pricing of goods, especially when they are new and the innovating firm is a monopolist, must proceed without precise knowledge of the demand curve. This paper provides a pricing method with a relative robustness guarantee by maximizing a perfor ...

Wiley2025

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

Alfio Quarteroni, Francesca Bonizzoni

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

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

Stabilized isogeometric discretizations on trimmed and union geometries, and weak imposition of the boundary conditions for the Darcy flow

Riccardo Puppi

Modern manufacturing engineering is based on a ``design-through-analysis'' workflow. According to this paradigm, a prototype is first designed with Computer-aided-design (CAD) software and then finalized by simulating its physical behavior, which usually i ...

EPFL2022

Designing compliant mechanisms composed of shape memory alloy and actuated by induction heating

Yves Perriard, Paolo Germano, Thomas Guillaume Martinez, Adrien Jean-Michel Thabuis, Sean Thomas

Shape Memory Alloys (SMAs) are a type of smart materials that reacts mechanically to heat. Due to their complex behavior, they are often used in a simple geometry such as wires. This constrains the output displacement of the alloy to a simple linear contra ...

2021

Additive Fabrication of Silicon Pillars on Monocrystalline Silicon by Direct Laser Melting

Marie Camille Laëtitia Le Dantec

Additive Manufacturing (AM) is an emerging part production technology that offers many ad-vantages such as high degree of customization, material savings and design of 3D highly complex structures. However, AM is a complex multiphysics process. Therefore, ...

EPFL2018

Range-based underwater target localization using an autonomous surface vehicle: Observability analysis

In the field of marine robotics, the problem of range based underwater target localization can be defined as that of localizing an unknown - fixed or moving - target from a surface vehicle called the tracker, using range information available about the tar ...

2018

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

Linear and non-linear studies of spurious backward-wave instabilities in a smooth-wall gyrotron beam duct

Stefano Alberti, Trach-Minh Tran, Jérémy Genoud, Patryk Kaminski

Recently developed self-consistent models for beam-wave interaction simulations of a gyrotron oscillator are used to study spurious backward-wave instabilities in smooth-wall metallic beam ducts. Starting from a simple case with a basic geometry, the influ ...

2017

On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves

János Pach

A long-standing conjecture of Richter and Thomassen states that the total number of intersection points between any n simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same point, is at least ...

Cambridge Univ Press2016

Real-time landing place assessment in man-made environments

Pascal Fua, Vincent Lepetit, Christos Marios Christoudias, Xiaolu Sun

We propose a novel approach to the real-time landing site detection and assessment in unconstrained man-made environments using passive sensors. Because this task must be performed in a few seconds or less, existing methods are often limited to simple loca ...

Springer Verlag2014

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

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

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

A new method for internal-external rotation measurement in a prosthetic knee

Kamiar Aminian, Arash Arami

In this work, a magnetic measurement system was designed and tested to estimate the Internal-External rotation between the Tibial and Femural parts of a knee prosthesis. To obtain this, the sensors were inserted in polyethylene part while a permanent magne ...

2012

Matrix ALPS: Accelerated Low Rank and Sparse Matrix Reconstruction

Volkan Cevher, Anastasios Kyrillidis

We propose Matrix ALPS for recovering a sparse plus low-rank decomposition of a matrix given its corrupted and incomplete linear measurements. Our approach is a first-order projected gradient method over non-convex sets, and it exploits a well-known memory ...

IEEE2012

What are the Longest Ropes on the Unit Sphere?

We consider the variational problem of finding the longest closed curves of given minimal thickness on the unit sphere. After establishing the existence of solutions for any given thickness between 0 and 1, we explicitly construct for each given thickness ...

Springer-Verlag2011

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

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