Related papers: Gap Processing for Adaptive Maximal Poisson-Disk S…
For large-scale point cloud processing, resampling takes the important role of controlling the point number and density while keeping the geometric consistency. % in related tasks. However, current methods cannot balance such different…
We propose a two-stage algorithm for generating Delaunay triangulations in 2D and Delaunay tetrahedra in 3D that employs near maximal Poisson-disk sampling. The method generates a variable resolution mesh in 2- and 3-dimensions in linear…
We present a fast method for generating random samples according to a variable density Poisson-disc distribution. A minimum threshold distance is used to create a background grid array for keeping track of those points that might affect any…
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…
A fundamental question is whether one can maintain a maximum independent set in polylogarithmic update time for a dynamic collection of geometric objects in Euclidean space. Already, for a set of intervals, it is known that no dynamic…
This paper deals with the question of conditional sampling and prediction for the class of stationary max-stable processes which allow for a mixed moving maxima representation. We develop an exact procedure for conditional sampling using…
We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a \PTAS. For the weighted case,…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
We investigate the deposition of binary mixtures of oriented superdisks on a plane. Superdisks are chosen as objects bounded by $|x|^{2p}+|y|^{2p}=1$, where parameter $p$ controls their size and shape. For single-type superdisks, the…
An algorithm for the unbiased simulation of continuous max-(resp.\ min-)id stochastic processes is developed. The algorithm only requires the simulation of finite Poisson random measures on the space of continuous functions and avoids the…
We review the derivation of the Kac master equation model for random collisions of particles, its relationship to the Poisson process, and existing algorithms for simulating values from the marginal distribution of velocity for a single…
Optimal design facilitates intelligent data collection. In this paper, we introduce a fully Bayesian design approach for spatial processes with complex covariance structures, like those typically exhibited in natural ecosystems. Coordinate…
We study the largest gaps between successive zeros of a smooth stationary Gaussian process. Our main result is that, if correlations decay at least polynomially, then after suitable rescaling of the locations and sizes of the largest gaps…
Microplastics contamination is one of the most rapidly growing research topics. However, monitoring microplastics contamination in the environment presents both logistical and statistical challenges, particularly when constrained resources…
Observations show evidence that a significant fraction of protoplanetary disks contain warps. A warp in a disk evolves in time affecting the appearance of shadows and greatly influencing kinematic signatures. So far, many theoretical…
In this investigation we focus on the problem of mapping the ground reflectivity with multiple laser scanners mounted on mobile robots/vehicles. The problem originates because regions of the ground become populated with a varying number of…
Simulating samples from arbitrary probability distributions is a major research program of statistical computing. Recent work has shown promise in an old idea, that sampling from a discrete distribution can be accomplished by perturbing and…
Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other. Each disk not in this subset must be merged with one of…
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations…
Symmetry reduced three-disk and five-disk systems are studied in a microwave setup. Using harmonic inversion the distribution of the imaginary parts of the resonances is determined. With increasing opening of the systems, a spectral gap is…