English
Related papers

Related papers: Non-simplicial Delaunay meshing via approximation …

200 papers

A Delaunay graph built on a planar point set has an edge between two vertices when there exists a disk with the two vertices on its boundary and no vertices in its interior. When the disk is replaced with an equilateral triangle, the…

Computational Geometry · Computer Science 2025-06-17 Prosenjit Bose , Jean-Lou De Carufel , John Stuart

In a recent paper we presented a linear scaling Kohn-Sham density functional theory (DFT) code based on Daubechies wavelets, where a minimal set of localized support functions is optimized in situ and therefore adapted to the chemical…

Materials Science · Physics 2015-10-08 Laura E. Ratcliff , Luigi Genovese , Stephan Mohr , Thierry Deutsch

Given a non-hermitean matrix M, the structure of its minimal polynomial encodes whether M is diagonalizable or not. This note will explain how to determine the minimal polynomial of a matrix without going through its characteristic…

Quantum Physics · Physics 2010-06-22 Stefan Weigert

The Hilbert metric is a distance function defined for points lying within the interior of a convex body. It arises in the analysis and processing of convex bodies, machine learning, and quantum information theory. In this paper, we show how…

Computational Geometry · Computer Science 2023-12-12 Auguste Gezalyan , Soo Kim , Carlos Lopez , Daniel Skora , Zofia Stefankovic , David M. Mount

We prove a scale-invariant boundary Harnack principle for inner uni- form domains in metric measure Dirichlet spaces. We assume that the Dirichlet form is symmetric, strongly local, regular, and that the volume doubling property and…

Probability · Mathematics 2014-06-09 Janna Lierl

We consider operators arising from regular Dirichlet forms with vanishing killing term. We give bounds for the bottom of the (essential) spectrum in terms of exponential volume growth with respect to an intrinsic metric. As special cases we…

Functional Analysis · Mathematics 2014-02-26 Sebastian Haeseler , Matthias Keller , Radosław K. Wojciechowski

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

In this paper, we consider non-diffusive variational problems with mixed boundary conditions and (distributional and weak) gradient constraints. The upper bound in the constraint is either a function or a Borel measure, leading to the state…

Optimization and Control · Mathematics 2021-06-25 Harbir Antil , Rafael Arndt , Carlos N. Rautenberg , Deepanshu Verma

The regular Dirichlet extension is the dual concept of regular Dirichlet subspace. The main purpose of this paper is to characterize all the regular Dirichlet extensions of one-dimensional Brownian motion and to explore their structures. It…

Probability · Mathematics 2016-06-03 Liping Li , Jiangang Ying

This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…

Metric Geometry · Mathematics 2007-05-23 Ezra Miller , Igor Pak

It is well known that all cells of the Voronoi diagram of a Delaunay set are polytopes. For a finite point set, all these cells are still polyhedra. So the question arises, if this observation holds for all discrete point sets: Are always…

Combinatorics · Mathematics 2008-11-11 Ina Voigt

This paper introduces a biharmonic interpolatory subdivision framework on Riemannian manifolds. In the Euclidean setting, the six-point Deslauriers-Dubuc stencil is characterised as the unique minimiser of a discrete curvature-variation…

General Mathematics · Mathematics 2026-04-16 Hassan Ugail , Newton Howard

We present medial parametrization, a new approach to parameterizing any compact planar domain bounded by simple closed curves. The basic premise behind our proposed approach is to use two close Voronoi sites, which we call dipoles, to…

Graphics · Computer Science 2024-03-08 Vinayak Krishnamurthy , Ergun Akleman

A new numerical method is presented for solving the rotating shallow water equations on a rotating sphere using quasi-uniform polygonal meshes. The method uses special families of finite element function spaces to mimic key mathematical…

Numerical Analysis · Mathematics 2015-06-23 John Thuburn , Colin J. Cotter

The Voronoi cone decompositions has been attracting our attention in the compactification problem of the moduli scheme of abelian varieties. The objects to add as the boundary of the moduli scheme are stable quasi-abelian schemes, reduced…

Algebraic Geometry · Mathematics 2019-05-03 Iku Nakamura , Ken Sugawara

We extend the method of layer potentials to manifolds with boundary and cylindrical ends. To obtain this extension along the classical lines, we have to deal with several technical difficulties due to the non-compactness of the boundary,…

Analysis of PDEs · Mathematics 2007-05-23 Marius Mitrea , Victor Nistor

We prove a novel method for the embedding of a 3-fold rotationally symmetric sphere-type mesh onto a subset of the plane with 3-fold rotational symmetry. The embedding is free-boundary with the only additional constraint on the image set is…

Computational Geometry · Computer Science 2024-06-12 Tom Gilat , Ben Gilat

We study the asymptotic growth of the eigenvalues of the Laplace-Beltrami operator on singular Riemannian manifolds, where all geometrical invariants appearing in classical spectral asymptotics are unbounded, and the total volume can be…

Differential Geometry · Mathematics 2023-11-23 Yacine Chitour , Dario Prandi , Luca Rizzi

Given a set of $n$ sites from $\mathbb{R}^d$, each having some positive weight factor, the Multiplicatively Weighted Voronoi Diagram is a subdivision of space that associates each cell to the site whose weighted Euclidean distance is…

Computational Geometry · Computer Science 2024-03-19 Joachim Gudmundsson , Martin P. Seybold , Sampson Wong

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…

Computational Geometry · Computer Science 2016-04-07 David Sinclair