Related papers: A 3D fast algorithm for computing Lagrangian coher…
The extraction of filamentary structure from a point cloud is discussed. The filaments are modeled as ridge lines or higher dimensional ridges of an underlying density. We propose two novel algorithms, and provide theoretical guarantees for…
Lagrangian methods continue to stand at the forefront of the analysis of time-dependent dynamical systems. Most Lagrangian methods have criteria that must be fulfilled by trajectories as they are followed throughout a given finite flow…
We present a quantum computing algorithm for fluid flows based on the Carleman-linearization of the Lattice Boltzmann (LB) method. First, we demonstrate the convergence of the classical Carleman procedure at moderate Reynolds numbers,…
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…
Given a structure made up of n sites connected by b bars, the problem of recognizing which subsets of sites form rigid units is not a trivial one, because of the non-local character of rigidity in central-force systems. Even though this is…
In this paper, we propose stochastic structure-preserving schemes to compute the effective diffusivity for particles moving in random flows. We first introduce the motion of particles using the Lagrangian formulation, which is modeled by…
Many applications of computer vision rely on the alignment of similar but non-identical images. We present a fast algorithm for aligning heterogeneous images based on optimal transport. Our approach combines the speed of fast Fourier…
Oceanic surface flows are dominated by finite-time Lagrangian coherent structures that separate regions of qualitatively different dynamical behavior. Among these, eddy boundaries are of particular interest. Their exact identification is…
Ordinary least squares (OLS) is the default method for fitting linear models, but is not applicable for problems with dimensionality larger than the sample size. For these problems, we advocate the use of a generalized version of OLS…
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…
We present a novel cell-centered direct Arbitrary-Lagrangian-Eulerian (ALE) finite volume scheme on unstructured triangular meshes that is high order accurate in space and time and that also allows for time-accurate local time stepping…
Array-like collection data structures are widely established in Python's scientific computing-ecosystem for high-performance computations. The structure maps well to regular, gridded lattice structures that are common to computational…
We develop a third-order conservative semi-Lagrangian discontinuous Galerkin (SLDG) scheme for solving linear transport equations on curvilinear unstructured triangular meshes, tailored for complex geometries. To ensure third-order spatial…
3D Gaussian Splatting (3DGS) based Simultaneous Localization and Mapping (SLAM) systems can largely benefit from 3DGS's state-of-the-art rendering efficiency and accuracy, but have not yet been adopted in resource-constrained edge devices…
We evaluate an efficient overset grid method for two-dimensional and three-dimensional particulate flows for small numbers of particles at finite Reynolds number. The rigid particles are discretised using moving overset grids overlaid on a…
The Calisson puzzle is a tiling puzzle in which one must tile a triangular grid inside a hexagon with lozenges, under the constraint that certain prescribed edges remain tile boundaries and that adjacent lozenges along these edges have…
The motion of an incompressible fluid in Lagrangian coordinates involves infinitely many symmetries generated by the left Lie algebra of group of volume preserving diffeomorphisms of the three dimensional domain occupied by the fluid.…
Computing a Single-Linkage Dendrogram (SLD) is a key step in the classic single-linkage hierarchical clustering algorithm. Given an input edge-weighted tree $T$, the SLD of $T$ is a binary dendrogram that summarizes the $n-1$ clusterings…
Given a set of 2-dimensional (2-D) scattering points, which are usually obtained from the edge detection process, the aim of ellipse fitting is to construct an elliptic equation that best fits the collected observations. However, some of…
Two new algorithms are described for matching two dimensional coordinate lists of point sources that are signifcantly faster than previous methods. By matching rarely occurring triangles (or more complex shapes) in the two lists, and by…