Related papers: Efficient Isoparametric Integration over Arbitrary…
Voronoi tessellations are used to partition the Euclidean space into polyhedral regions, which are called Voronoi cells. Labeling the Voronoi cells with the class information, we can map any classification problem into a Voronoi…
We point out that interesting features in high energy physics data can be determined from properties of Voronoi tessellations of the relevant phase space. For illustration, we focus on the detection of kinematic "edges" in two dimensions,…
This work concerns adaptive refinement procedures for meshes of polygonal virtual elements. Specifically, refinement procedures previously proposed by the authors for structured meshes are generalized for the challenging case of arbitrary…
We introduce a novel simulation scheme, iVi (integrated Volterra implicit), for integrated Volterra square-root processes and Volterra Heston models based on the Inverse Gaussian distribution. The scheme is designed to handle $L^1$ kernels…
The Voronoi Density Estimator (VDE) is an established density estimation technique that adapts to the local geometry of data. However, its applicability has been so far limited to problems in two and three dimensions. This is because…
Using the Wentzel-Kramers-Brillouin method, we derive a modified form of the Thomas-Fermi approximation to electron density. This new result enables us to calculate the details of the self-consistent ion cores, as well as the ionization…
We introduce a novel random integration algorithm that boasts both high convergence order and polynomial tractability for functions characterized by sparse frequencies or rapidly decaying Fourier coefficients. Specifically, for integration…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
A novel inline data compression method is presented for single-precision vectors in three dimensions. The primary application of the method is for accelerating computational physics calculations where the throughput is bound by memory…
The Voronoi Entropy (VE) and the continuous measure of symmetry (CSM) characterize the orderliness of a set of points on a 2D plane. The Voronoi entropy is the Shannon entropy of the Voronoi tessellation of the plane into polygons,…
This paper introduces a novel method for the efficient and accurate computation of volume fractions on unstructured polyhedral meshes, where the phase boundary is an orientable hypersurface, implicitly given as the iso-contour of a…
VORO++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. VORO++ was released in 2009 and is based on computing the…
High energy experimental data can be viewed as a sampling of the relevant phase space. We point out that one can apply Voronoi tessellations in order to understand the underlying probability distributions in this phase space. Interesting…
In solid-state physics, energies of crystals are usually computed with a plane-wave discretization of Kohn-Sham equations. However the presence of Coulomb singularities requires the use of large plane-wave cut-offs to produce accurate…
We present an efficient algorithm for the all-electron periodic Coulomb matrix based on the Ewald summation combined with the Fourier-transformed Coulomb method. The short-range contributions involving compact densities are evaluated in…
This paper presents a new approach to obtaining nearly complete coverage paths (CP) with low overlapping on 3D general surfaces using mesh models. The CP is obtained by segmenting the mesh model into a given number of clusters using…
The large-scale matter distribution represents a complex network of structure elements such as voids, clusters, filaments, and sheets. This network is spanned by a point distribution. The global properties of the point process can be…
The Voronoi tessellation is the partition of space for a given seeds pattern and the result of the partition depends completely on the type of given pattern "random", Poisson-Voronoi tessellations (PVT), or "non-random", Non Poisson-Voronoi…
votess is a library for computing parallel 3D Voronoi tessellations on heterogeneous platforms, from CPUs and GPUs, to future accelerator architectures. To do so, it leverages the SYCL abstraction layer to achieve portability and…
Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of…