Related papers: Degeneracy of Angular Voronoi Diagram
We study the "generic" degenerations of curves with two singular points when the points merge. First, the notion of generic degeneration is defined precisely. Then a method to classify the possible results of generic degenerations is…
In this paper, we present a new approach to obtain symmetric tiles with curved edges. Our approach is based on using higher-order Voronoi sites that are closed under wallpaper symmetries. The resulting Voronoi tessellations provide us with…
We study a class of graphs with finitely many edges in order to understand the nature of the formal logarithm of the generating series for Severi degrees in elementary combinatorial terms. These graphs are related to floor diagrams…
We introduce a dense counterpart of graph degeneracy, which extends the recently-proposed invariant symmetric difference. We say that a graph has sd-degeneracy (for symmetric-difference degeneracy) at most $d$ if it admits an elimination…
We show that triangle-free penny graphs have degeneracy at most two, list coloring number (choosability) at most three, diameter $D=\Omega(\sqrt n)$, and at most $\min\bigl(2n-\Omega(\sqrt n),2n-D-2\bigr)$ edges.
We point out that interesting features in high energy physics data can be determined from properties of Voronoi tessellations of the relevant phase space. For illustration, we focus on the detection of kinematic "edges" in two dimensions,…
An isogeny graph is a graph whose vertices are principally polarized abelian varieties and whose edges are isogenies between these varieties. In his thesis, Kohel described the structure of isogeny graphs for elliptic curves and showed that…
Many methods for modelling spatial processes assume global smoothness properties; such assumptions are often violated in practice. We introduce a method for modelling spatial processes that display heterogeneity or contain discontinuities.…
We describe deformations of vector bundles on surfaces that are a product of two smooth projective curves. We explicitly describe the Kuranishi map around unstable vector bundles and compare the homologies of the Kuranishi spaces of stable…
An important open question in the modeling of biological tissues is how to identify the right scale for coarse-graining, or equivalently, the right number of degrees of freedom. For confluent biological tissues, both vertex and Voronoi…
We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these methods can generate meshes of several types: (1) the elements…
High energy experimental data can be viewed as a sampling of the relevant phase space. We point out that one can apply Voronoi tessellations in order to understand the underlying probability distributions in this phase space. Interesting…
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in any number of dimensions. These conditions are natural for…
Anomaly detection aims to identify data instances that deviate significantly from majority of data, which has been widely used in fraud detection, network security, and industrial quality control. Existing methods struggle with datasets…
Calculations on atomistic scale are necessary for understanding of physical phenomena occurring during advanced processing of liquids, slurries, and nano-ceramics composite materials. This paper describes some new ideas for using the…
We introduce a general, efficient method to completely describe the topology of individual grains, bubbles, and cells in three-dimensional polycrystals, foams, and other multicellular microstructures. This approach is applied to a pair of…
Are the embeddings of a graph's degenerate core stable? What happens to the embeddings of nodes in the degenerate core as we systematically remove periphery nodes (by repeated peeling off $k$-cores)? We discover three patterns w.r.t.…
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…
The network formed by ridges in a straightened sheet of crumpled paper is studied using a laser profilometer. Square sheets of paper were crumpled into balls, unfolded and their height profile measured. From these profiles the imposed…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…