Related papers: Random Delaunay triangulations and metric uniformi…
Discrete integration is a fundamental problem in computer science that concerns the computation of discrete sums over exponentially large sets. Despite intense interest from researchers for over three decades, the design of scalable…
The inverse Ising problem seeks to reconstruct the parameters of an Ising Hamiltonian on the basis of spin configurations sampled from the Boltzmann measure. Over the last decade, many applications of the inverse Ising problem have arisen,…
For a surface immersed in a three-dimensional space endowed with a norm instead of an inner product, one can define analogous concepts of curvature and metric. With these concepts in mind, various questions immediately appear. The aim of…
An algorithm for the generation of non-uniform unstructured grids on ellipsoidal geometries is described. This technique is designed to generate high quality triangular and polygonal meshes appropriate for general circulation modelling on…
The curvature regularities are well-known for providing strong priors in the continuity of edges, which have been applied to a wide range of applications in image processing and computer vision. However, these models are usually non-convex,…
We consider the inverse problem of reconstructing inhomogeneities by performing a finite number of scattering measurements of acoustic type in the time-harmonic setting. We set up the reconstruction as a fully discrete variational problem…
We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result…
In this paper, we investigate the reconstruction of a bivariate function from weighted edge integrals on a triangular mesh, a problem of central importance in tomography, computer vision, and numerical approximation. Our approach is based…
We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior…
We propose an inverse design framework for metasurfaces that achieves highly uniform two-dimensional intensity profiles across an on-demand shape. The optimization objective is formulated to enhance overall projection efficiency via the…
We study rotational surfaces with constant Minkowski Gaussian curvature and rotational surfaces with constant Minkowski mean curvature in a $3$-dimensional normed space with rotationally symmetric norm. We have a generalization of the…
Intrinsic Delaunay triangulation (IDT) is a fundamental data structure in computational geometry and computer graphics. However, except for some theoretical results, such as existence and uniqueness, little progress has been made towards…
For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…
Discrete rearranging patterns include cellular patterns, for instance liquid foams, biological tissues, grains in polycrystals; assemblies of particles such as beads, granular materials, colloids, molecules, atoms; and interconnected…
With the advancement in 3D scanning technology, there has been a surge of interest in the use of point clouds in science and engineering. To facilitate the computations and analyses of point clouds, prior works have considered…
Geometric predicates are at the core of many algorithms, such as the construction of Delaunay triangulations, mesh processing and spatial relation tests. These algorithms have applications in scientific computing, geographic information…
In this survey we present the most recent developments in the uniformization of metric surfaces, i.e., metric spaces homeomorphic to two-dimensional topological manifolds. We start from the classical conformal uniformization theorem of…
In the study of depth functions it is important to decide whether we want such a function to be sensitive to multimodality or not. In this paper we analyze the Delaunay depth function, which is sensitive to multimodality and compare this…
Hyperuniformity refers to the suppression of density fluctuations at large scales. Typical for ordered systems, this property also emerges in several disordered physical and biological systems, where it is particularly relevant to…
We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-$k$ mosaic from incrementally constructed lower-order mosaics…