Related papers: Orphan-Free Anisotropic Voronoi Diagrams
We consider heteroclinic networks between $n \in \mathbb{N}$ nodes where the only connections are those linking each node to its two subsequent neighbouring ones. Using a construction method where all nodes are placed in a single…
The phase space of $N$ damped linear oscillators is endowed with a bilinear map under which the evolution operator is symmetric. This analog of self-adjointness allows properties familiar from conservative systems to be recovered, e.g.,…
Physical systems are frequently modeled as sets of points in space, each representing the position of an atom, molecule, or mesoscale particle. As many properties of such systems depend on the underlying ordering of their constituent…
Nonequilibrium statistical models of point vortex systems are constructed using an optimal closure method, and these models are employed to approximate the relaxation toward equilibrium of systems governed by the two-dimensional Euler…
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…
This work addresses the collaborative multi-robot autonomous online exploration problem, particularly focusing on distributed exploration planning for dynamically balanced exploration area partition and task allocation among a team of…
We review the model of the Voronoi Diagrams which allows to reproduce the large-scale structures of our universe as given by the astronomical catalogs. The observed number of galaxies in a given solid angle with a chosen flux/magnitude…
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…
Let $P$ be a simple polygon with $n$ vertices. For any two points in $P$, the geodesic distance between them is the length of the shortest path that connects them among all paths contained in $P$. Given a set $S$ of $m$ sites being a subset…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…
There is a pressing need for a description of complex systems that includes considerations of the underlying network of interactions, for a diverse range of biological, technological and other networks. In this work relationships between…
A graph is an efficient open (resp.\ closed) domination graph if there exists a subset of vertices whose open (resp.\ closed) neighborhoods partition its vertex set. Graphs that are efficient open as well as efficient closed (shortly EOCD…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
We present a topological proof of the existence of invariant manifolds for maps with normally hyperbolic-like properties. The proof is conducted in the phase space of the system. In our approach we do not require that the map is a…
Analyzing nodal domains is a way to discern the structure of eigenvectors of operators on a graph. We give a new definition extending the concept of nodal domains to arbitrary signed graphs, and therefore to arbitrary symmetric matrices. We…
Complex structures often emerge from initially homogeneous or weakly correlated states. We address the apparent tension between this ordering and entropy growth through a unified framework combining semi-microscopic phase-space dynamics,…
Necessary and sufficient conditions for the exactness (in the algebraic sense) of certain sequences of continuous group homomorphisms are established.
We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…
We investigate the problem of computing the shortest secure path in a Voronoi diagram. Here, a path is secure if it is a sequence of touching Voronoi cells, where each Voronoi cell in the path has a uniform cost of being secured.…
The Voronoi diagram is a certain geometric data structure which has numerous applications in various scientific and technological fields. The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and…