English
Related papers

Related papers: Gap Processing for Adaptive Maximal Poisson-Disk S…

200 papers

Matrix completion algorithms fill missing entries in a large matrix given a subset of observed samples. However, how to best pre-select informative matrix entries given a sampling budget is largely unaddressed. In this paper, we propose a…

Signal Processing · Electrical Eng. & Systems 2020-06-24 Fen Wang , Yongchao Wang , Gene Cheung , Cheng Yang

We propose to test the homogeneity of a Poisson process observed on a finite interval. In this framework, we first provide lower bounds for the uniform separation rates in $\mathbb{L}^2$ norm over classical Besov bodies and weak Besov…

Statistics Theory · Mathematics 2009-05-08 M. Fromont , B. Laurent , P. Reynaud-Bouret

We study the distribution of the 'gap time', the first time that a large gap appears, in the spatial birth and death point process on $[0,1]$ in which particles are added uniformly in space at rate $\lambda$ and are removed independently at…

Probability · Mathematics 2025-12-05 Eric Foxall , Clément Soubrier

Gaussian processes (GPs) are widely used in nonparametric regression, classification and spatio-temporal modeling, motivated in part by a rich literature on theoretical properties. However, a well known drawback of GPs that limits their use…

Methodology · Statistics 2011-06-29 Anjishnu Banerjee , David Dunson , Surya Tokdar

Swept volume computation, the determination of regions occupied by moving objects, is essential in graphics, robotics, and manufacturing. Existing approaches either explicitly track surfaces, suffering from robustness issues under complex…

Computational Geometry · Computer Science 2025-09-12 Pengfei Wang , Yuexin Yang , Shuangmin Chen , Shiqing Xin , Changhe Tu , Wenping Wang

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…

Data Structures and Algorithms · Computer Science 2017-06-21 Michael Jünger , Petra Mutzel , Christiane Spisla

Transitional disks are protoplanetary disks with opacity gaps/cavities in their dust distribution, a feature that may be linked to planet formation. We perform Bayesian modeling of the three transitional disks SZ Cha, CS Cha and T25…

Solar and Stellar Astrophysics · Physics 2016-02-17 Á. Ribas , H. Bouy , B. Merín , G. Duchêne , I. Rebollido , C. Espaillat , C. Pinte

Computer models are used as replacements for physical experiments in a large variety of applications. Nevertheless, direct use of the computer model for the ultimate scientific objective is often limited by the complexity and cost of the…

Methodology · Statistics 2019-07-03 Sonja Surjanovic , William J. Welch

For better learning, large datasets are often split into small batches and fed sequentially to the predictive model. In this paper, we study such batch decompositions from a probabilistic perspective. We assume that data points (possibly…

Machine Learning · Computer Science 2025-04-10 Ghurumuruhan Ganesan

This work considers sequential edge-promoting Bayesian experimental design for (discretized) linear inverse problems, exemplified by X-ray tomography. The process of computing a total variation type reconstruction of the absorption inside…

Methodology · Statistics 2021-04-02 Tapio Helin , Nuutti Hyvönen , Juha-Pekka Puska

Controllable, high-fidelity mesh editing remains a significant challenge in 3D content creation. Existing generative methods often struggle with complex geometries and fail to produce detailed results. We propose CraftMesh, a novel…

Graphics · Computer Science 2026-03-31 James Jincheng , Yuxiao Wu , Youcheng Cai , Ligang Liu

We present a new, simple, fast algorithm to numerically evolve disks of inelastically colliding particles surrounding a central star. Our algorithm adds negligible computational cost to the fastest existing collisionless N-body codes, and…

Astrophysics · Physics 2008-11-26 Yoram Lithwick , Eugene Chiang

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson , Sariel Har-Peled

Gaussian processes (GPs) provide flexible distributions over functions, with inductive biases controlled by a kernel. However, in many applications Gaussian processes can struggle with even moderate input dimensionality. Learning a low…

Machine Learning · Computer Science 2020-01-01 Ian A. Delbridge , David S. Bindel , Andrew Gordon Wilson

This paper studies the performance of antenna array processing in distributed multiple access networks without power control. The interference is represented as a Poisson point process. Desired and interfering signals are subject to both…

Information Theory · Computer Science 2016-11-17 Olfa Ben Sik Ali , Christian Cardinal , Francois Gagnon

The random sequential adsorption of various particle shapes is studied in order to determine the influence of particle anisotropy on the saturated random packing. For all tested particles there is an optimal level of anisotropy which…

Materials Science · Physics 2015-10-28 Michał Cieśla , Grzegorz Pająk , Robert M. Ziff

We present and discuss several old and new methods for mapping a circular disc to a square. In particular, we present analytical expressions for mapping each point (u,v) inside the circular disc to a point (x,y) inside a square region.…

History and Overview · Mathematics 2024-12-30 Chamberlain Fong

The gravitational influence of a planet on a nearby disk provides a powerful tool for detecting and studying extrasolar planetary systems. Here we demonstrate that gaps can be opened in dynamically cold debris disks at the mean-motion…

Earth and Planetary Astrophysics · Physics 2016-03-30 Maryam Tabeshian , Paul Wiegert

A Gaussian Process (GP) is a prominent mathematical framework for stochastic function approximation in science and engineering applications. This success is largely attributed to the GP's analytical tractability, robustness, non-parametric…

Machine Learning · Statistics 2022-05-19 Marcus M. Noack , Harinarayan Krishnan , Mark D. Risser , Kristofer G. Reyes

In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the…

Computational Geometry · Computer Science 2021-10-11 Mariusz Wzorek , Cyrille Berger , Patrick Doherty