Related papers: Valeriepieris Circles for Spatial Data Analysis
This paper deals with the problem of circle packing, in which the largest radii circle is to be fit in a confined space filled with arbitrary circles of different radii and centers. A circle packing problem is one of a variety of cutting…
The process of drawing electoral district boundaries is known as political redistricting. Within this context, gerrymandering is the practice of drawing these boundaries such that they unfairly favor a particular political party, often…
We propose a bare-bones stochastic model that takes into account both the geographical distribution of people within a country and their complex network of connections. The model, which is designed to give rise to a scale-free network of…
We study a model of a population making a binary decision based on information spreading within the population, which is fully connected or covering a square grid. We assume that a fraction of the population wants to make the choice of the…
With new catalogues arriving such as the Gaia DR1, containing more than a billion objects, new methods of handling and visualizing these data volumes are needed. In visualization, one problem is that the number of datapoints can become so…
Voronoi diagrams appear in many areas in science and technology and have numerous applications. They have been the subject of extensive investigation during the last decades. Roughly speaking, they are a certain decomposition of a given…
We present an alternative, Bayesian method for large-scale reconstruction from observed peculiar velocity data. The method stresses a rigorous treatment of the random errors and it allows extrapolation into poorly sampled regions in real…
This paper studies how spatial thinking interacts with simplicity in [informal] proof, by analysing a set of example proofs mainly concerned with Ferrers diagrams (visual representations of partitions of integers, and comparing them to…
The multidimensional nature of spatial data poses a challenge for visualization. In this paper, we introduce Phoenixmap, a simple abstract visualization method to address the issue of visualizing multiple spatial distributions at once. The…
Individuals together with their locations & attributes are essential to feed micro-level applied urban models (for example, spatial micro-simulation and agent-based modeling) for policy evaluation. Existed studies on population…
We examine the growth of eccentricities of a population of particles with initially circular orbits around a central massive body. Successive encounters between pairs of particles increase the eccentricities in the disk on average. As long…
The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the…
We measure the two-point density correlations and Voronoi cell distributions of cyclically sheared granular spheres obtained with a fluorescence technique and compare them with random packing of frictionless spheres. We find that the radial…
For pedestrians moving without spatial constraints, extensive research has been devoted to develop methods of density estimation. In this paper we present a new approach based on Voronoi cells, offering a means to estimate density for…
We present a population control method with sampling and regulation steps for Monte Carlo particles involved in the numerical simulation of a transport equation. We recall in the first section the difficulties related to the variance…
A substantial share of the Earth's land surface is managed by humans, with cities representing the most extreme form of anthropogenic land use. There are zillion ways in which settlements can be arranged across a given area, and their…
Any system of bisectors (in the sense of abstract Voronoi diagrams) defines an arrangement of simple curves in the plane. We define Voronoi-like graphs on such an arrangement, which are graphs whose vertices are locally Voronoi. A vertex…
The sparsest cut problem consists of identifying a small set of edges that breaks the graph into balanced sets of vertices. The normalized cut problem balances the total degree, instead of the size, of the resulting sets. Applications of…
Construction of tight confidence regions and intervals is central to statistical inference and decision making. This paper develops new theory showing minimum average volume confidence regions for categorical data. More precisely, consider…
The Wallenius distribution is a generalisation of the Hypergeometric distribution where weights are assigned to balls of different colours. This naturally defines a model for ranking categories which can be used for classification purposes.…