Related papers: Proximal Delaunay Triangulation Regions
Local convergence analysis of the proximal point method for special class of nonconvex function on Hadamard manifold is presented in this paper. The well definedness of the sequence generated by the proximal point method is guaranteed.…
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…
Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of…
Given two distinct point sets $P$ and $Q$ in the plane, we say that $Q$ \emph{blocks} $P$ if no two points of $P$ are adjacent in any Delaunay triangulation of $P\cup Q$. Aichholzer et al. (2013) showed that any set $P$ of $n$ points in…
We analyze the local convergence of proximal splitting algorithms to solve optimization problems that are convex besides a rank constraint. For this, we show conditions under which the proximal operator of a function involving the rank…
Given a triangulation of a closed surface, we consider a cross ratio system that assigns a complex number to every edge satisfying certain polynomial equations per vertex. Every cross ratio system induces a complex projective structure…
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
We prove that uniform random triangulations whose genus is proportional to their size $n$ have diameter of order $\log n$ with high probability. We also show that in such triangulations, the distances between most pairs of points differ by…
A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…
I present a 3D advancing-front mesh refinement algorithm that generates a constrained Delaunay mesh for any piecewise linear complex (PLC) and extend this algorithm to produce truly Delaunay meshes for any PLC. First, as in my recently…
Matchbox manifolds ${\mathfrak M}$ are a special class of foliated spaces, which includes as special examples exceptional minimal sets of foliations, weak solenoids, suspensions of odometer and Toeplitz actions, and tiling spaces associated…
In this paper we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems including Delaunay triangulation, linear programming, closest pair, smallest enclosing disk,…
Casual structure can take the form of cone bundles on a manifold, more general local preorders on a topological space, or simplicial orientations implicit in a simplicial set. This note takes a triangulation of a conal manifold M to mean an…
We prove that the deformation space of geodesic triangulations of a flat torus is homotopy equivalent to a torus. This solves an open problem proposed by Connelly et al. in 1983, in the case of flat tori. A key tool of the proof is a…
In this paper a new connection between the discrete conformal geometry problem of disk pattern construction and the continuous conformal geometry problem of metric uniformization is presented. In a nutshell, we discuss how to construct disk…
We defined several functionals on the set of all triangulations of the finite system of points in d-space achieving global minimum on the Delaunay triangulation (DT). We consider a so called "parabolic" functional and prove it attains its…
We prove a conjecture of Benjamini and Curien stating that the local limits of uniform random triangulations whose genus is proportional to the number of faces are the Planar Stochastic Hyperbolic Triangulations (PSHT) defined in…
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…
This article introduces a theory of proximal nerve complexes and nerve spokes, restricted to the triangulation of finite regions in the Euclidean plane. A nerve complex is a collection of filled triangles with a common vertex, covering a…