Related papers: Voronoi cells of discrete point sets
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal…
In this note, we resolve a question of D'Achille, Curien, Enriquez, Lyons, and \"Unel by showing that the cells of the ideal Poisson Voronoi tessellation are indistinguishable. This follows from an application of the Howe-Moore theorem and…
We prove that every mapping torus of any free group endomorphism is residually finite. We show how to use a not yet published result of E. Hrushovski to extend our result to arbitrary linear groups. The proof uses algebraic self-maps of…
The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…
We consider the ideal of inner $2$-minors $I_{\mathcal{P}}$ of a finite set of cells $\mathcal{P}$, which we call the cell ideal of $\mathcal{P}$. A nice interpretation for the height of an unmixed ideal $I_{\mathcal{P}}$, in terms of the…
Karol Borsuk in 1968 asked: Is it true that every finite polyhedron dominates only finitely many different shapes? Danuta Kolodziejczyk showed that generally an answer to the Borsuk question is negative and also presented a positive answer…
Consider a given space, e.g., the Euclidean plane, and its decomposition into Voronoi regions induced by given sites. It seems intuitively clear that each point in the space belongs to at least one of the regions, i.e., no neutral region…
We consider in this paper discrete improper affine spheres based on asymptotic nets. In this context, we distinguish the discrete edges and vertices that must be considered singular. The singular edges can be considered as discrete cuspidal…
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…
We study relations between transitivity, mixing and periodic points on dendrites. We prove that when there is a point with dense orbit which is not an endpoint, then periodic points are dense and there is a terminal periodic decomposition…
The Delaunay tessellation of a locally finite subset of hyperbolic space is constructed using convex hulls in Euclidean space of one higher dimension. For finite and lattice-invariant sets it is proven to be a polyhedral decomposition, and…
Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…
For a group of pedestrians without any spatial boundaries, the methods of density estimation is a wide area of research. Besides, there is a specific difficulty when the density along one given pedestrian trajectory is needed in order to…
In this paper we define and investigate a class of polytopes which we call "vertex generated" consisting of polytopes which are the average of their $0$ and $n$ dimensional faces. We show many results regarding this class, among them: that…
In this thesis we study sets of points in the plane and their Voronoi diagrams, in particular when the points coincide. We bring together two ways of studying point sets that have received a lot of attention in recent years: Voronoi…
The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…
For three-dimensional circular-quiver supersymmetric Chern-Simons theories, the questions, whether duality cascades always terminate and whether the endpoint is unique, were rephrased into the question whether a polytope defined in the…
An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding.…