Related papers: Slime Mould Inspired Generalised Voronoi Diagrams …
Acellular slime mould Physarum polycephalum is a popular now user-friendly living substrate for designing of future and emergent sensing and computing devices. P. polycephalum exhibits regular patterns of oscillations of its surface…
In this article, we propose a numerical method to solve semi-discrete optimal transport problems for gigantic pointsets (108 points and more). By pushing the limits by several orders of magnitude, it opens the path to new applications in…
Poisson point processes provide a versatile framework for modeling the distributions of random points in space. When the space is partitioned into cells, each associated with a single generating point from the Poisson process, there appears…
In this paper, we study a generalization of the classical Voronoi diagram, called clustering induced Voronoi diagram (CIVD). Different from the traditional model, CIVD takes as its sites the power set $U$ of an input set $P$ of objects. For…
The Phychip project is a collaborative European research initiative to design and implement computation using the organism Physarum polycephalum; it is funded by the Seventh Framework Programme (FP7) by the European Commission within CORDIS…
The application of Voronoi and Delaunay tessellation based methods for reconstructing continuous fields from discretely sampled data sets is discussed. The succesfull operation as ``multidimensional interpolation'' method is corroborated…
This paper introduces an efficient approach to reduce the computational cost of simulating collective behaviors, such as fish schooling, using Individual-Based Models (IBMs). The proposed technique employs adaptive and dynamic…
We describe a new algorithm for computing the Voronoi diagram of a set of $n$ points in constant-dimensional Euclidean space. The running time of our algorithm is $O(f \log n \log \Delta)$ where $f$ is the output complexity of the Voronoi…
In stark contrast to the case of images, finding a concise, learnable discrete representation of 3D surfaces remains a challenge. In particular, while polygon meshes are arguably the most common surface representation used in geometry…
How do the topology and geometry of a tubular network affect the spread of particles within fluid flows? We investigate patterns of effective dispersion in the hierarchical, biological transport network formed by Physarum polycephalum. We…
The 3D network originated by the faces of irregular Poissonian Voronoi Polyhedrons may represent the backbone on which the galaxies are originated. As a consequence the spatial appearance of the catalogs of galaxies can be reproduced. The…
In this paper, we propose to compute Voronoi diagrams over mesh surfaces driven by an arbitrary geodesic distance solver, assuming that the input is a triangle mesh as well as a collection of sites $P=\{p_i\}_{i=1}^m$ on the surface. We…
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…
Voronoi diagrams are highly compact representations that are used in various Graphics applications. In this work, we show how to embed a differentiable version of it -- via a novel deep architecture -- into a generative deep network. By…
The large-scale structure of the universe is comprised of virialized blob-like clusters, linear filaments, sheet-like walls and huge near empty three-dimensional voids. Characterizing the large scale universe is essential to our…
Could simple organisms such as slime mould approximate LI without recourse to neural tissue? We describe a model whereby LI can emerge without explicit inhibitory wiring, using only bulk transport effects. We use a multi-agent model of…
Since the Voronoi diagram appears in many applications, the topic of improving its computational efficiency remains attractive. We propose a novel yet efficient method to compute Voronoi diagrams bounded by a given domain, i.e., the clipped…
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 tessellation, also known as Voronoi diagram, is an important computational geometry technique that has applications in various scientific disciplines. It involves dividing a given space into regions based on the proximity to a set…
Cellular structures manifest their outstanding mechanical properties in many biological systems. One key challenge for designing and optimizing these geometrically complicated structures lies in devising an effective geometric…