Related papers: A computational approach to an optimal partition p…
Set partitioning is a key component of many algorithms in machine learning, signal processing, and communications. In general, the problem of finding a partition that minimizes a given impurity (loss function) is NP-hard. As such, there…
Users frequently seek to fabricate objects whose outer surfaces consist of regions with different surface attributes, such as color or material. Manufacturing such objects in a single piece is often challenging or even impossible. The…
We derive error estimates for the piecewise linear finite element approximation of the Laplace--Beltrami operator on a bounded, orientable, $C^3$, surface without boundary on general shape regular meshes. As an application, we consider a…
This note is about promoting singularity subtraction as a helpful tool in the discretization of singular integral operators on curved surfaces. Singular and nearly singular kernels are expanded in series whose terms are integrated on…
Motivated by relativistic materials, we develop a numerical scheme to support existing or state new conjectures in the spectral optimisation of eigenvalues of the Dirac operator, subject to infinite-mass boundary conditions. We study the…
In this work, we prove an existence result for an optimal partition problem of the form $$\min \{F_s(A_1,\dots,A_m)\colon A_i \in \mathcal{A}_s, \, A_i\cap A_j =\emptyset \mbox{ for } i\neq j\},$$ where $F_s$ is a cost functional with…
In this paper, we study triply periodic surfaces with minimal surface area under a constraint in the volume fraction of the regions (phases) that the surface separates. Using a variational level set method formulation, we present a…
We present a framework for solving partial different equations on evolving surfaces. Based on the grid-based particle method (GBPM) [18], the method can naturally resample the surface even under large deformation from the motion law. We…
We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…
We present a boundary integral method, and an accompanying boundary element discretization, for solving boundary-value problems for the Laplace-Beltrami operator on the surface of the unit sphere $\S$ in $\mathbb{R}^3$. We consider a closed…
Report on the numerical approximation of the Ventcel problem. The Ventcel problem is a 3D eigenvalue problem involving a surface differential operator on the domain boundary: the Laplace Beltrami operator. We present in the first section…
The Laplace-Beltrami problem on closed surfaces embedded in three dimensions arises in many areas of physics, including molecular dynamics (surface diffusion), electromagnetics (harmonic vector fields), and fluid dynamics (vesicle…
We study superconvergent discretization of the Laplace-Beltrami operator on time-space product manifolds with Neumann temporal boundary values, which arise in the context of dynamic optimal transport on general surfaces. We propose a…
Sparse eigenproblems are important for various applications in computer graphics. The spectrum and eigenfunctions of the Laplace--Beltrami operator, for example, are fundamental for methods in shape analysis and mesh processing. The…
We optimize a selection of eigenvalues of the Laplace operator with Dirichlet or Neumann boundary conditions by adjusting the shape of the domain on which the eigenvalue problem is considered. Here, a phase-field function is used to…
Numerical solutions of partial differential equations (PDEs) on manifolds continues to generate a lot of interest among scientists in the natural and applied sciences. On the other hand, recent developments of 3D scanning and computer…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
We study the problem of multiway number partition optimization, which has a myriad of applications in the decision, learning and optimization literature. Even though the original multiway partitioning problem is NP-hard and requires…
Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge partition has demonstrated more promising performance in…
An isogeometric approach for solving the Laplace-Beltrami equation on a two-dimensional manifold embedded in three-dimensional space using a Galerkin method based on Catmull-Clark subdivision surfaces is presented and assessed. The…