Related papers: A computational approach to an optimal partition p…
We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an…
This article is devoted to the study of spectral optimisation for inhomogeneous plates. In particular, we optimise the first eigenvalue of a vibrating plate with respect to its thickness and/or density. Our result is threefold. First, we…
Given a conformal action of a discrete group on a Riemann surface, we study the maximization of Laplace and Steklov eigenvalues within a conformal class, considering metrics invariant under the group action. We establish natural conditions…
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has been done, the problem reduces to well understood uniprocessor…
This paper is concerned with the nonconforming finite element discretization of geometric partial differential equations. In specific, we construct a surface Crouzeix-Raviart element on the linear approximated surface, analogous to a flat…
In this paper, we introduce a novel star partitioning problem for simple connected graphs $G=(V,E)$. The goal is to find a partition of the edges into stars that minimizes the maximum number of stars a node is contained in while…
We compare surface metrics for shape optimization problems with constraints, consisting mainly of partial differential equations (PDE), from a computational point of view. In particular, classical Laplace-Beltrami type based metrics are…
Towards identifying the number of minimal surfaces sharing the same boundary from the geometry of the boundary, we propose a numerical scheme with high speed and high accuracy. Our numerical scheme is based on the method of fundamental…
We present a rigorous scheme that makes it possible to compute eigenvalues of the Laplace operator on hyperbolic surfaces within a given precision. The method is based on an adaptation of the method of particular solutions to the case of…
We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…
We propose a volumetric formulation for computing the Optimal Transport problem defined on surfaces in $\mathbb{R}^3$, found in disciplines like optics, computer graphics, and computational methodologies. Instead of directly tackling the…
The Closest Point Method for solving partial differential equations (PDEs) posed on surfaces was recently introduced by Ruuth and Merriman [J. Comput. Phys. 2008] and successfully applied to a variety of surface PDEs. In this paper we study…
We consider the problem of optimal path planning on a manifold which is the image of a smooth function. Optimal path-planning is of crucial importance for motion planning, image processing, and statistical data analysis. In this work, we…
A new method is introduced for solving Laplace problems on 2D regions with corners by approximation of boundary data by the real part of a rational function with fixed poles exponentially clustered near each corner. Greatly extending a…
We present a novel segmentation algorithm based on a hierarchical representation of images. The main contribution of this work is to explore the capabilities of the A Contrario reasoning when applied to the segmentation problem, and to…
The discretization of elliptic PDEs leads to large coupled systems of equations. Domain decomposition methods (DDMs) are one approach to the solution of these systems, and can split the problem in a way that allows for parallel computing.…
In this work is considered a spectral problem, involving a second order term on the domain boundary: the Laplace-Beltrami operator. A variational formulation is presented, leading to a finite element discretization. For the Laplace-Beltrami…
In this note we shall introduce a simple, effective numerical method for solving partial differential equations for scalar and vector-valued data defined on surfaces. Even though we shall follow the traditional way to approximate the…
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the…