Related papers: Random Delaunay triangulations and metric uniformi…
Any three-dimensional Riemannian metric can be locally obtained by deforming a constant curvature metric along one direction. The general interest of this result, both in geometry and physics, and related open problems are stressed.
Deep Convolutional Neural Networks (DCNN) have been proven to be effective for various computer vision problems. In this work, we demonstrate its effectiveness on a continuous object orientation estimation task, which requires prediction of…
We construct constant mean curvature surfaces in euclidean space with genus zero and n ends asymptotic to Delaunay surfaces using the DPW method.
De-homogenization is becoming an effective method to significantly expedite the design of high-resolution multiscale structures, but existing methods have thus far been confined to simple static compliance minimization. There are two…
The main goal of this paper is to present the application of structural sums, mathematical objects originating from the computational materials science, in construction of a feature space vector of 2D random composites simulated by…
Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an unknown input distribution D. We assume here that D is of product type. More precisely, suppose that we…
We study the distributed stochastic compositional optimization problems over directed communication networks in which agents privately own a stochastic compositional objective function and collaborate to minimize the sum of all objective…
This paper explores the utility of diffusion-based models for anomaly detection, focusing on their efficacy in identifying deviations in both compact and high-resolution datasets. Diffusion-based architectures, including Denoising Diffusion…
The paper analyses properties of a large class of "path-based" Data Envelopment Analysis models through a unifying general scheme. The scheme includes the well-known oriented radial models, the hyperbolic distance function model, the…
Proximity maps and regions are defined based on the relative allocation of points from two or more classes in an area of interest and are used to construct random graphs called proximity catch digraphs (PCDs) which have applications in…
The density hypothesis on random times becomes now a standard in modeling of risks. One of the basic reasons to introduce the density hypothesis is the desire to have a computable credit risk model. However, recent work shows that merely an…
Our work presents a novel approach to shape optimization, with the twofold objective to improve the efficiency of global optimization algorithms while promoting the generation of high-quality designs during the optimization process free of…
In this article, recent works on 2D Constrained Delaunay triangulation(CDT) algorithms have been reported. Since the review of CDT algorithms presented by de Floriani(Issues on Machine Vision, Springer Vienna, pg. 95--104, 1989), different…
Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. We show that two locally finite circle patterns covering the unit disc are related by a…
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-$k$ Delaunay if the…
We present a new framework for creating elegant algorithms for exact uniform sampling of important Catalan structures, such as triangulations of convex polygons, Dyck words, monotonic lattice paths and mountain ranges. Along with sampling,…
We are interested in the kernel of one-dimensional diffusion equations with continuous coefficients as evaluated by means of explicit discretization schemes of uniform step $h>0$ in the limit as $h\to0$. We consider both semidiscrete…
A method of ``blocking'' triangulations that rests on the self-similarity feature of dynamically triangulated random manifolds is proposed. The method is used to define the renormalization group for random geometries. As an illustration,…
A Delaunay cell decomposition of a surface with constant curvature gives rise to a circle pattern, consisting of the circles which are circumscribed to the facets. We treat the problem whether there exists a Delaunay cell decomposition for…