Related papers: Delaunay Hodge Star
We initiate a statistical study of Kalai's exterior algebraic shifting, focusing on concentration phenomena for random triangulations of a fixed space. First, for a uniform $n$-vertex refinement of any given graph $G$, we show that…
We show that the Discrete Exterior Calculus (DEC) method can be cast as the earlier box method for the Poisson problem in the plane. Consequently, error estimates are established, proving that the DEC method is comparable to the Finite…
There are very few mathematical results governing the interpolation of functions or their gradients on Delaunay meshes in more than two dimensions. Unfortunately, the standard techniques for proving optimal interpolation properties are…
This article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved. To describe…
The present work develops, verifies, and benchmarks a hybrid discrete exterior calculus and finite difference (DEC-FD) method for density-stratified thermal convection in spherical shells. Discrete exterior calculus (DEC) is notable for its…
The alpha complex is a fundamental data structure from computational geometry, which encodes the topological type of a union of balls $B(x; r) \subset \mathbb{R}^m$ for $x\in S$, including a weighted version that allows for varying radii.…
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 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…
An interface preserving moving mesh algorithm in two or higher dimensions is presented. It resolves a moving $(d-1)$-dimensional manifold directly within the $d$-dimensional mesh, which means that the interface is represented by a subset of…
Using the geodesic distance on the $n$-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function…
We prove a uniform upper and lower bound for Delannoy numbers. This is achieved by using the representation of Delannoy numbers as the number of lattice points in high-dimensional cross-polytopes (also known as hyper-octahedrons or $\ell^1$…
I present a generalization of Chew's first algorithm for Delaunay mesh refinement. In his algorithm, Chew splits the line segments of the input planar straight line graph (PSLG) into shorter subsegments whose lengths are nearly identical.…
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted,…
The conjoining of dynamical systems and deep learning has become a topic of great interest. In particular, neural differential equations (NDEs) demonstrate that neural networks and differential equation are two sides of the same coin.…
We combine the DPW method and Opening Nodes to construct embedded surfaces of positive constant mean curvature with Delaunay ends in euclidean space, with no limitation to the genus or number of ends.
Given a finite set of points in $\mathbb R^n$ and a radius parameter, we study the \v{C}ech, Delaunay-\v{C}ech, Delaunay (or Alpha), and Wrap complexes in the light of generalized discrete Morse theory. Establishing the \v{C}ech and…
In this paper, we prove that the closure of a bounded pseudoconvex domain, which is spirallike with respect to a globally asymptotic stable holomorphic vector field, is polynomially convex. We also provide a necessary and sufficient…
We develop the formalism of derived divided power algebras, and revisit the theory of derived De Rham and derived crystalline cohomology in this framework. We characterize derived De Rham cohomology of a derived commutative algebra $A$ over…
Two-dimensional Delaunay triangulation is a fundamental aspect of computational geometry. This paper presents a novel algorithm that is specifically designed to ensure the correctness of 2D Delaunay triangulation, namely the Polygonal…
The ability to differentiate through optimization problems has unlocked numerous applications, from optimization-based layers in machine learning models to complex design problems formulated as bilevel programs. It has been shown that…