Related papers: Fast Spherical Centroidal Voronoi Mesh Generation:…
In this work, we approach the problem of resource allocation in a team of agents through the framework of Centroidal Voronoi Tessellations. CVTs provide a natural way to embed a desired global trend in the team through probability…
We present a new open source code for massive parallel computation of Voronoi tessellations(VT hereafter) in large data sets. The code is focused for astrophysical purposes where VT densities and neighbors are widely used. There are several…
Voronoi diagrams are essential geometrical structures with numerous applications, particularly astrophysics-driven finite volume methods. While serial algorithms for constructing these entities are well-established, parallel construction…
Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions with respect to a given probability measure. CVT…
The 3D tree visualization faces multiple challenges: the election of an appropriate layout, the use of the interactions that make the data exploration easier and a metaphor that helps in the process of information understanding. A good…
This paper introduces a novel, robust, and computationally efficient framework for high-quality quadrilateral mesh generation on general two-dimensional domains. The core of the proposed approach is a novel method for computing cross fields…
We have developed a new parallel tree method which will be called the forest method hereafter. This new method uses the sectional Voronoi tessellation (SVT) for the domain decomposition. The SVT decomposes a whole space into polyhedra and…
Low-dose computed tomography (LDCT) reconstruction is fundamentally challenged by severe noise and compromised data fidelity under reduced radiation exposure. Most existing methods operate either in the image or post-log projection domain,…
We present a novel high order semi-implicit hybrid finite volume/virtual element numerical scheme for the solution of compressible flows on Voronoi tessellations. The method relies on the flux splitting of the compressible Navier-Stokes…
Voronoi diagrams, and their more general weighted counterpart, power diagrams, are fundamental geometric constructs with wide-ranging applications. Recently, they have gained renewed attention in mesh-based neural rendering. Despite being…
Mimicking natural tessellation patterns is a fascinating multi-disciplinary problem. Geometric methods aiming at reproducing such partitions on surface meshes are commonly based on the Voronoi model and its variants, and are often faced…
Unlike other schemes that locally violate the essential stability properties of the analytic parabolic and elliptic problems, Voronoi finite volume methods (FVM) and boundary conforming Delaunay meshes provide good approximation of the…
We present a variational framework in which Centroidal Voronoi Tessellations (CVTs) arise as local minimizers of a generalized electrostatic energy functional. By modeling interior point distributions in a convex domain as repelling charges…
In this work, a cut high-dimensional model representation (cut-HDMR) expansion based on multiple anchors is constructed via the clustering method. Specifically, a set of random input realizations is drawn from the parameter space and…
The recently developed interpolative separable density fitting (ISDF) decomposition is a powerful way for compressing the redundant information in the set of orbital pairs, and has been used to accelerate quantum chemistry calculations in a…
We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth boundary fragments are approximated by the Voronoi edges and…
An algorithm for the generation of non-uniform unstructured grids on ellipsoidal geometries is described. This technique is designed to generate high quality triangular and polygonal meshes appropriate for general circulation modelling on…
This paper presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtained from Delaunay triangulations. To generate the polygonal mesh, the algorithm first uses a classification system to label each edge of an input…
Autoregressive multimodal large language models (MLLMs) enable 3D generation but struggle to scale to high-resolution shapes due to inadequate 3D tokenizations. Compact set-based representations discard deterministic spatial ordering,…
Modeling of spherical metasurfaces using Generalized Sheet Transition Conditions (GSTCs) and Vector Wave Function (VWF) expansion is presented. The fields internal and external to the metasurface is expanded in terms of spherical VWFs and…