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.

169,096 papers · 148 categories

Trend · papers per month

23466891 · Jun 202019922001200920182026
48 results for Delaunay patterns

Properness proven for circle packings and Delaunay patterns on complex projective structures.

problem Proving properness for circle packings and Delaunay patterns on complex projective structures.
method Considering circle packings and Delaunay circle patterns on surfaces with complex projective structures, proving properness of the forgetful map.
result Proved properness of the forgetful map sending circle packings and Delaunay patterns to underlying complex structures.

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 consider ``hyperideal'' circle patterns, i.e. patterns of disks appearing in the definition of the Delaunay decomposition associated to a set of disjoint disks, possibly with cone singularities at the center of those disks. Hyperideal circle patterns are associated to hyperideal hyperbolic polyhedra. We describe the…

2006-01-22abs ↗pdf ↗

Study circle patterns and polyhedral surfaces in hyperbolic ends, proving manifold properties.

problem Understanding the space of complex projective structures on surfaces with circle patterns.
method Analyzing ideal polyhedral surfaces in hyperbolic ends, proving manifold properties and Lagrangian immersions.
result The space of complex projective structures on surfaces with circle patterns is a manifold of dimension 6g-6.

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 a given (topological) cell decomposition and given intersection angles of the ci…

2003-12-18abs ↗pdf ↗

The study connects triangulated surfaces to complex projective structures and circle patterns.

problem Understanding circle patterns on complex projective tori.
method Using discrete holomorphic quadratic differentials, the approach involves cross ratio systems and Delaunay angles.
result For any triangulated torus, the projection map is a covering map with at most one branch point.

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 ↗

DTL uses Delaunay triangulation for nonparametric function approximation.

problem Functional approximation in high-dimensional feature spaces.
method Delaunay triangulation to partition feature space into simplices, fitting linear models within each.
result DTL's geometrically optimal triangulation improves function approximation accuracy.

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 article discusses how to create a special type of triangle mesh for surfaces in 3D space.

problem Creating a special type of triangle mesh for surfaces in 3D space.
method Using sufficient conditions and the diagonal switch algorithm to find an embedded Delaunay triangulation.
result The diagonal switch algorithm can find an embedded Delaunay triangulation for a point cloud on an embedded surface in R3\mathbb{R}^3.

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 ↗

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 ↗

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.

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 ↗

Study classifies metrics on a twice-punctured sphere, proving Delaunay metrics are complete.

problem Classifying metrics on a twice-punctured sphere.
method Analyzes Delaunay metrics and proves a sharp conformal factor bound.
result Proves that most conformal flat metrics on a twice-punctured sphere are Delaunay metrics.

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 ↗

No compact surfaces with specific curvature can exist near singular limits.

problem Existence of surfaces with prescribed mean curvature near singular limits.
method Analyzing mappings and Delaunay tori in Euclidean 3-space.
result No parametric surface with the specified curvature exists near singular limits.

In his seminal 1951 paper "Extreme forms" Coxeter \cite{cox51} observed that for n9n \ge 9 one can add vectors to the perfect lattice $\sfA_9$ so that the resulting perfect lattice, called $\sfA_9^2$ by Coxeter, has exactly the same set of minimal vectors. An inhomogeneous analog of the notion of perfect lattice is tha…

2009-05-28abs ↗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.

Optimal Euclidean structure minimizes energy in weighted toroidal graphs.

problem Finding the optimal Euclidean structure for weighted toroidal graphs.
method Minimizing Dirichlet energy over all possible Euclidean structures and realizations within a fixed homotopy class.
result The optimal Euclidean structure induces a weighted Delaunay decomposition.

New connection found between shape reconstruction methods and persistent homology.

problem Connecting shape reconstruction methods with persistent homology.
method Wrap complexes and lexicographic optimal homologous cycles.
result Lexicographically optimal homologous cycles are supported on Wrap complexes.

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.

In this paper we produce families of complete non compact Riemannian metrics with positive constant σkσ_k-curvature by performing the connected sum of a finite number of given nn-dimensional Delaunay type solutions, provided 22k<n2 \leq 2k < n. The problem is equivalent to solve a second order fully nonlinear elliptic eq…

2010-08-03abs ↗pdf ↗

We give two numerical methods for computing the first bifurcation point for Delaunay nodoids. With regard to methods for constructing constant mean curvature surfaces, we conclude that the bifurcation point in the analytic method of Mazzeo-Pacard is the same as a limiting point encountered in the integrable systems met…

2004-10-06abs ↗pdf ↗

We construct Delaunay-type solutions for the fractional Yamabe problem with an isolated singularity $(-Δ)^γw = c_{n, γ} w^{\frac{n+2γ}{n-2γ}}, w>0 \ \mbox{in} \ \mathbb{R}^n \backslash \{0\}$ We follow a variational approach, in which the key is the computation of the fractional Laplacian in polar coordinates.

2015-10-28abs ↗pdf ↗