Related papers: PARAVT: Parallel Voronoi Tessellation code
Document parsing, as a fundamental yet crucial vision task, is being revolutionized by vision-language models (VLMs). However, the autoregressive (AR) decoding inherent to VLMs creates a significant bottleneck, severely limiting parsing…
We present an objective and automated procedure for detecting clusters of galaxies in imaging galaxy surveys. Our Voronoi Galaxy Cluster Finder (VGCF) uses galaxy positions and magnitudes to find clusters and determine their main features:…
Motivated by the sequence reconstruction problem from traces in DNA-based storage, we consider the problem of designing codes for the deletion channel when multiple observations (or traces) are available to the decoder. We propose simple…
Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-pair level measure called…
A Voronoi diagram partitions the plane into convex cells, each containing the points closest to a single generator. Given such a tessellation, the inverse Voronoi problem seeks the generator set \( S \) that produced it. Our algorithm…
Voronoi grids have been successfully used to represent density structures of gas in astronomical hydrodynamics simulations. While some codes are explicitly built around using a Voronoi grid, others, such as Smoothed Particle Hydrodynamics…
Multidimensional nucleosynthesis studies with hundreds of nuclei linked through thousands of nuclear processes are still computationally prohibitive. To date, most nucleosynthesis studies rely either on hydrostatic/hydrodynamic simulations…
In this article, we propose a new fast nearest neighbor search algorithm, based on vector quantization. Like many other branch and bound search algorithms [1,10], a preprocessing recursively partitions the data set into disjointed subsets…
In our recent paper [de Lacy Costello et al. 2010] we described the formation of complex tessellations of the plane arising from the various reactions of metal salts with potassium ferricyanide and ferrocyanide loaded gels. In addition to…
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…
Parallel algorithms for ab initio calculations of vibrations modes of solids are presented and implemented under PVM. Load balancing and communication problems are dealt with in order to increase parallelism efficiency. For accurate time…
The VERTEX code is employed for multi-dimensional neutrino-radiation hydrodynamics simulations of core-collapse supernova explosions from first principles. The code is considered state-of-the-art in supernova research and it has been used…
Swarm robotics, or very large-scale robotics (VLSR), has many meaningful applications for complicated tasks. However, the complexity of motion control and energy costs stack up quickly as the number of robots increases. In addressing this…
We propose an automated method for detecting galaxy clusters in imaging surveys based on the Voronoi tessellation technique. It appears very promising, expecially for its capability of detecting clusters indipendently from their shape.…
Torsional modes within a complex molecule containing various functional groups are often strongly coupled so that the harmonic approximation and one-dimensional torsional treatment are inaccurate to evaluate their partition functions. A…
Consider two remote nodes (encoder and decoder), each with a binary sequence. The encoder's sequence $X$ differs from the decoder's sequence $Y$ by a small number of edits (deletions and insertions). The goal is to construct a message $M$,…
3D Voronoi's tessellation method was first applied to identify groups of galaxies in the structure of a supercluster. The sample under consideration consists of more than 7000 galaxies of the Local Supercluster (LS) with radial velocities…
The TREE method has been widely used for long-range interaction {\it N}-body problems. We have developed a parallel TREE code for two-component classical plasmas with open boundary conditions and highly non-uniform charge distributions. The…
In big-data analytics, using tensor decomposition to extract patterns from large, sparse multivariate data is a popular technique. Many challenges exist for designing parallel, high performance tensor decomposition algorithms due to…
The Voronoi diagram is a certain geometric data structure which has numerous applications in various scientific and technological fields. The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and…