Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

371013 · Nov 202019922001200920172026
48 results for Delaunay triangulation

Minimal Delaunay triangulations on hyperbolic surfaces have linear number of vertices.

problem Finding the minimum number of vertices in Delaunay triangulations of hyperbolic surfaces.
method Analyzing the genus gg of hyperbolic surfaces to derive bounds on the number of vertices.
result The number of vertices in minimal Delaunay triangulations of hyperbolic surfaces is linear in the genus gg.

Delaunay has shown that the Delaunay complex of a finite set of points PP of Euclidean space Rm\mathbb{R}^m triangulates the convex hull of PP, provided that PP satisfies a mild genericity property. Voronoi diagrams and Delaunay complexes can be defined for arbitrary Riemannian manifolds. However, Delaunay's generic…

2016-12-09abs ↗pdf ↗

We propose a differentiable nonparametric algorithm, the Delaunay triangulation learner (DTL), to solve the functional approximation problem on the basis of a pp-dimensional feature space. By conducting the Delaunay triangulation algorithm on the data points, the DTL partitions the feature space into a series of pp-d…

2019-06-02abs ↗pdf ↗

The paper confirms conjectures about the topology of triangulated polyhedra and geodesic triangulations on spheres.

problem Topology of spaces of convex polyhedra and Delaunay triangulations on spheres.
method Variational principles on triangulated surfaces.
result Spaces of Delaunay triangulations have the same homotopy types as their smooth counterparts on the unit 2-sphere.

The paper classifies adjacencies in LL^\infty-Delaunay triangulations of abelian differentials.

problem Classifying adjacencies in LL^\infty-Delaunay triangulations of abelian differentials.
method Classification through a finite simplicial complex construction.
result A finite simplicial complex with the same homotopy type as H(κ)\mathcal H(κ) is constructed.

Bayesian optimization uses triangulation candidates for better performance.

problem Non-convex and multi-modal optimization challenges in Bayesian optimization.
method Proposes using Delaunay triangulation candidates for discrete search over continuous optimization.
result Triangulation candidates outperform numerically optimized and random alternatives.

Locality regularized reconstruction finds sparse coefficients for sparse and structured data.

problem Finding sparse coefficients for linear representations of data.
method Solves a regularized least squares regression problem with a locality function promoting use of columns close to the target vector.
result Optimal coefficients have at most d+1d+1 non-zero entries, and can be supported on the vertices of the Delaunay simplex.

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface is connected. We give upper bounds on the number of edge f…

2019-12-10abs ↗pdf ↗

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 patterns by optimizing an objective function, which turns out to be intimately …

2000-10-31abs ↗pdf ↗

We define a discrete Laplace-Beltrami operator for simplicial surfaces. It depends only on the intrinsic geometry of the surface and its edge weights are positive. Our Laplace operator is similar to the well known finite-elements Laplacian (the so called ``cotan formula'') except that it is based on the intrinsic Delau…

2005-03-11abs ↗pdf ↗

In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erdös-Renyi random graphs, geometric random graphs, expanders and random kk-regular graphs. Moreover we show that …

2012-03-22abs ↗pdf ↗

In this paper we characterize a function defined on the set of edges of a triangulated surface such that there is a spherical angle structure having the function as the edge invariant (or Delaunay invariant). We also characterize a function such that there is a hyperbolic angle structure having the function as the edge…

2006-01-20abs ↗pdf ↗

Proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

problem Existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.
method Construct an isotopic map instead of edge-flipping algorithm, generalizing Dyer et al's method.
result Strict proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

A Delaunay decomposition is a cell decomposition in R^d for which each cell is inscribed in a Euclidean ball which is empty of all other vertices. This article introduces a generalization of the Delaunay decomposition in which the Euclidean balls in the empty ball condition are replaced by other families of regions bou…

2016-02-11abs ↗pdf ↗

The paper discusses triangulations of Gromov sets and their properties.

problem Understanding triangulations of Gromov subsets in metric spaces.
method Review and extension of Chew's triangulation result for ηη-Gromov subsets of R2\mathbb{R}^{2}, and construction of subdivisions with controlled edge lengths and angles.
result The existence of geodesic triangulations with controlled side lengths and angles for compact Riemannian 2-manifolds.

We compute the convex hull in C2\mathbb{C}^2 of an arbitrary finite subgroup of C2{\mathbb{C}^*}^2. The combinatorics are dictated by continued fractions in a natural way. This reproves a theorem of Smilansky, with a slightly stronger intermediary step.

2009-01-18abs ↗pdf ↗

This work generalizes a geometric Laplacian determinant description to higher dimensions.

problem Defining and understanding the Laplacian determinant in higher dimensions with non-Delaunay triangulations.
method Geometric description of the Laplacian determinant in higher dimensions, relating it to volume quantities derived from simplex geometry.
result Generalizes geometric Laplacian determinant description to higher dimensions, showing negative semidefiniteness and kernel of constants.

We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or…

2018-03-20abs ↗pdf ↗

Proves rigidity of circle packings in the plane, generalizing previous work.

problem Rigidity of infinite inversive distance circle packings in the plane.
method Maximal principle for generic weighted Delaunay inversive distance circle packings and ring lemma for inversive distance circle packings in hexagonal triangulated plane.
result Proves Bowers-Stephenson's conjecture for inversive distance circle packings.

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 together with a circle pattern on the closed surface. In particular, there is an ass…

2019-09-16abs ↗pdf ↗

Given a lattice L of R^n, a polytope D is called a Delaunay polytope in L if the set of its vertices is S\cap L where S is a sphere having no lattice points in its interior. D is called perfect if the only ellipsoid in R^n that contains S\cap L is exactly S. For a vector v of the Leech lattice Λ_{24} we define Λ_{24}(v…

2009-07-04abs ↗pdf ↗

We consider constant mean curvature 1 surfaces in R3\mathbb{R}^3 arising via the DPW method from a holomorphic perturbation of the standard Delaunay potential on the punctured disk. Kilian, Rossman and Schmitt have proven that such a surface is asymptotic to a Delaunay surface. We consider families of such potentials p…

2017-10-02abs ↗pdf ↗

The generalized Weierstrass representation is used to analyze the asymptotic behavior of a constant mean curvature surface that arises locally from an ordinary differential equation with a regular singularity. We prove that a holomorphic perturbation of an ODE that represents a Delaunay surface generates a constant mea…

2007-01-03abs ↗pdf ↗

In this study the Voronoi interpolation is used to interpolate a set of points drawn from a topological space with higher homology groups on its filtration. The technique is based on Voronoi tessellation, which induces a natural dual map to the Delaunay triangulation. Advantage is taken from this fact calculating the p…

2019-11-08abs ↗pdf ↗

Classical Delaunay surfaces are highly symmetric constant mean curvature (CMC) submanifolds of space forms. We prove the existence of Delaunay-type hypersurfaces in a large class of compact manifolds, using the geometry of cohomogeneity one group actions and variational bifurcation techniques. Our construction speciali…

2013-06-25abs ↗pdf ↗

Given a finite set of points in Rn\mathbb R^n and a radius parameter, we study the Čech, Delaunay-Čech, Delaunay (or Alpha), and Wrap complexes in the light of generalized discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel sets of generalized discrete Morse functions, we prove that the four…

2013-12-04abs ↗pdf ↗

The paper constructs solutions to a critical Dirac equation on spheres.

problem Solving the critical Dirac equation on spheres with singularities.
method Constructing Delaunay-type solutions and another kind of singular solutions.
result The constructed solutions are building blocks for singular solutions on Spin manifolds.

A finite subset S of a closed hyperbolic surface F canonically determines a "centered dual decomposition" of F: a cell structure with vertex set S, geodesic edges, and 2-cells that are unions of the corresponding Delaunay polygons. Unlike a Delaunay polygon, a centered dual 2-cell Q is not determined by its collection …

2011-03-23abs ↗pdf ↗