Related papers: GPU Voronoi Diagrams for Random Moving Seeds
Grain microstructures are crucial to the mechanical properties, performance, and often lifetime of metallic components. Hence, the prediction of grain microstructures emerging from solidification processes at relevant macroscopic scale is…
Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fr\`{e}chet distance. In this…
Extraction of a high-fidelity 3D medial axis is a crucial operation in CAD. When dealing with a polygonal model as input, ensuring accuracy and tidiness becomes challenging due to discretization errors inherent in the mesh surface.…
In this paper, the acceleration of algorithms using a design of a field programmable gate array (FPGA) as a prototype of a static dataflow architecture is discussed. The static dataflow architecture using operators interconnected by…
Probabilistic circuits (PCs) enable exact and tractable inference but employ data independent mixture weights that limit their ability to capture local geometry of the data manifold. We propose Voronoi tessellations (VT) as a natural way to…
The ability to attend to salient regions of a visual scene is an innate and necessary preprocessing step for both biological and engineered systems performing high-level visual tasks (e.g. object detection, tracking, and classification).…
This paper introduces a novel approach to embed flow-based models with hierarchical structures. The proposed framework is named Variational Flow Graphical (VFG) Model. VFGs learn the representation of high dimensional data via a…
An optimal data partitioning in parallel & distributed implementation of clustering algorithms is a necessary computation as it ensures independent task completion, fair distribution, less number of affected points and better & faster…
Dynamic graph random walk (DGRW) emerges as a practical tool for capturing structural relations within a graph. Effectively executing DGRW on GPU presents certain challenges. First, existing sampling methods demand a pre-processing buffer,…
We study the Voronoi Diagram of Rotating Rays, a Voronoi structure where the input sites are rays and the distance function between a point and a site/ray, is the counterclockwise angular distance. This novel Voronoi diagram is motivated by…
The area query, to find all elements contained in a specified area from a certain set of spatial objects, is a very important spatial query widely required in various fields. A number of approaches have been proposed to implement this…
In this paper, we propose a novel non-standard Local Fourier Analysis (LFA) variant for accurately predicting the multigrid convergence of problems with random and jumping coefficients. This LFA method is based on a specific basis of the…
We present GridFF, an efficient method for simulating molecules on rigid substrates, derived from techniques used in protein-ligand docking in biochemistry. By projecting molecule-substrate interactions onto precomputed spatial grids with…
Microstructural evolution in structural materials is known to occur in response to mechanical loading and can often accommodate substantial plastic deformation through the coupled motion of grain boundaries (GBs). This can produce desirable…
A numerical investigation of grain-boundary grooving by means of a Level Set method is carried out. An idealized polygranular interconnect which consists of grains separated by parallel grain boundaries aligned normal to the average…
Breadth-First Search (BFS) is a building block used in a wide array of graph analytics and is used in various network analysis domains: social, road, transportation, communication, and much more. Over the last two decades, network sizes…
Overlaid oriented Voronoi diagrams (OOVDs) are known to provide useful data for the construction of optimal Euclidean $1$-Steiner trees. The theoretical time complexity of construction methods exploiting the OOVD is $O(n^2)$, but a…
The round-trip distance function on a geographic network (such as a road network, flight network, or utility distribution grid) defines the "distance" from a single vertex to a pair of vertices as the minimum length tour visiting all three…
We present here RICH, a state of the art 2D hydrodynamic code based on Godunov's method, on an unstructured moving mesh (the acronym stands for Racah Institute Computational Hydrodynamics). This code is largely based on the code AREPO. It…
We study Voronoi diagrams of manifolds and varieties with respect to polyhedral norms. We provide upper and lower bounds on the dimensions of Voronoi cells. For algebraic varieties, we count their full-dimensional Voronoi cells. As an…