相关论文: Parallel Delaunay Refinement: Algorithms and Analy…

We present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two…

The de Rham complex arises naturally when studying problems in electromagnetism and fluid mechanics. Stable numerical methods to solve these problems can be obtained by using a discrete de Rham complex that preserves the structure of the…

On the basis of a local-projective (LP) approach we develop a method of noise reduction in time series that makes use of nonlinear constraints appearing due to the deterministic character of the underlying dynamical system. The Delaunay…

Mesh adaptivity is a useful tool for efficient solution to partial differential equations in very complex geometries. In the present paper we discuss the use of polygonal mesh refinement in order to tackle two common issues: first,…

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…

We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location structure is organized into…

This paper presents an algorithm to generate a new kind of polygonal mesh obtained from triangulations. Each polygon is built from a terminal-edge region surrounded by edges that are not the longest-edge of any of the two triangles that…

Sampling algorithms play an important role in controlling the quality and runtime of diffusion model inference. In recent years, a number of works~\cite{chen2023sampling,chen2023ode,benton2023error,lee2022convergence} have proposed schemes…

Mesh partitioning is an indispensable tool for efficient parallel numerical simulations. Its goal is to minimize communication between the processes of a simulation while achieving load balance. Established graph-based partitioning tools…

Deep learning models trained on large data sets have been widely successful in both vision and language domains. As state-of-the-art deep learning architectures have continued to grow in parameter count so have the compute budgets and times…

The Delaunay-Rips filtration is a lighter and faster alternative to the well-known Rips filtration for low-dimensional Euclidean point clouds. Despite these advantages, it has seldom been studied. In this paper, we aim to bridge this gap by…

Since the seminal work of Idelsohn, O\~nate and Del-Pin (2004), the Particle Finite Element Method (PFEM) has relied on a Delaunay triangulation and the Alpha--Shape (AS) algorithm in the remeshing process. This approach guarantees a good…

This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…

As deep neural networks (DNNs) become deeper, the training time increases. In this perspective, multi-GPU parallel computing has become a key tool in accelerating the training of DNNs. In this paper, we introduce a novel methodology to…

Conformal surface parameterization is useful in graphics, imaging and visualization, with applications to texture mapping, atlas construction, registration, remeshing and so on. With the increasing capability in scanning and storing data,…

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 ubiquity of massive graph data sets in numerous applications requires fast algorithms for extracting knowledge from these data. We are motivated here by three electrical measures for the analysis of large small-world graphs $G = (V, E)$…

This paper proposes two contributions to the calculation of free surface flows using the particle finite element method (PFEM). The PFEM is based on a Lagrangian approach: a set of particles defines the fluid. Then, unlike a pure Lagrangian…

Recent probabilistic methods for 3D triangular meshes capture diverse shapes by differentiable mesh connectivity, but face high computational costs with increased shape details. We introduce a new differentiable mesh processing method that…

Numerical simulation of the complex plasma dynamics associated with high power, high frequency microwave breakdown at high pressures, leading to the formation of filamentary plasma structures such as self-organized plasma arrays, is a…