Related papers: Order-2 Delaunay Triangulations Optimize Angles

We merge and extend recent results which prove the H1-stability of the L2-orthogonal projection onto standard finite element spaces, provided that the underlying simplicial triangulation is appropriately graded. For lowest-order Courant…

The restricted Delaunay triangulation of a closed surface $\Sigma$ and a finite point set $V \subset \Sigma$ is a subcomplex of the Delaunay tetrahedralization of $V$ whose triangles approximate $\Sigma$. It is well known that if $V$ is a…

We study the distributed optimization problem over a graphon with a continuum of nodes, which is regarded as the limit of the distributed networked optimization as the number of nodes goes to infinity. Each node has a private local cost…

We consider an infinite, planar, Delaunay graph which is obtained by locally deforming the embedding of a general, isoradial graph, w.r.t. a real deformation parameter $\epsilon$. This entails a careful analysis of edge-flips induced by the…

This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…

We study the optimization of (strongly) quasar-convex functions, a class that arises naturally in many machine learning and data science applications due to its favorable properties. The fundamental properties of this class are first…

Classical global convergence results for first-order methods rely on uniform smoothness and the \L{}ojasiewicz inequality. Motivated by properties of objective functions that arise in machine learning, we propose a non-uniform refinement of…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

We study the theoretical convergence properties of random-search methods when optimizing non-convex objective functions without having access to derivatives. We prove that standard random-search methods that do not rely on second-order…

In Euclidean 3-space endowed with a Cartesian reference system we consider a class of surfaces, called Delaunay tori, constructed by bending segments of Delaunay cylinders with neck-size $a$ and $n$ lobes along circumferences centered at…

A new O(nlog(n)) algorithm is presented for performing Delaunay triangulation of sets of 2D points. The novel component of the algorithm is a radially propagating \emph{sweep-hull} (sequentially created from the radially sorted set of 2D…

We develop a method for optimization in shape spaces, i.e., sets of surfaces modulo re-parametrization. Unlike previously proposed gradient flows, we achieve superlinear convergence rates through a subtle approximation of the shape Hessian,…

We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted…

Adaptive optimization methods are well known to achieve superior convergence relative to vanilla gradient methods. The traditional viewpoint in optimization, particularly in convex optimization, explains this improved performance by arguing…

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…

The local structure of terminal Brauer classes on arithmetic surfaces were classified in [CI21] generalising the classification on geometric surfaces carried out in [CI05]. Part of the interest in these classifications is that it enables…

We present a new overlay, called the {\em Deterministic Decentralized tree} ($D^2$-tree). The $D^2$-tree compares favourably to other overlays for the following reasons: (a) it provides matching and better complexities, which are…

In this paper, we present an adaptive framework for constructing a pseudo-optimal reduced model for the frequency-limited H2-optimal model order reduction problem. We show that the frequency-limited pseudo-optimal reduced-order model has an…

This paper proposes improvements to the physically-based surface triangulation method, bubble meshing. The method simulates physical bubbles to automatically generate mesh vertices, resulting in high-quality Delaunay triangles. Despite its…

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…