Related papers: Degeneracy of Angular Voronoi Diagram

We complete the remaining cases of the conjecture predicting existence of infinitely many rational curves on K3 surfaces in characteristic zero, prove almost all cases in positive characteristic and improve the proofs of the previously…

Ruled surfaces play an important role in various types of design, architecture, manufacturing, art, and sculpture. They can be created in a variety of ways, which is a topic that has been the subject of much discussion in mathematics and…

We present careful numerical convergence studies, using parameterized curves to reach very high resolutions in two dimensions, of a level set method for multiphase curvature motion known as the Voronoi implicit interface method. Our tests…

In this work, we introduce a novel evaluation framework for generative models of graphs, emphasizing the importance of model-generated graph overlap (Chanpuriya et al., 2021) to ensure both accuracy and edge-diversity. We delineate a…

We consider a preferential attachment model that incorporates an anomaly. Our goal is to understand the evolution of the network before and after the occurrence of the anomaly by studying the influence of the anomaly on the structural…

A kernel of a directed graph is a subset of vertices that is both independent and absorbing (every vertex not in the kernel has an out-neighbour in the kernel). Not all directed graphs contain kernels, and computing a kernel or deciding…

Origami structures are characterized by a network of folds and vertices joining unbendable plates. For applications to mechanical design and self-folding structures, it is essential to understand the interplay between the set of folds in…

A new approach to the generation of random sequences and two dimensional random patterns is proposed in this paper in which random sequences are generated by making use of either Delaunay triangulation or Voronoi diagrams drawn from random…

Kuranishi structures were introduced in the 1990s by Fukaya and Ono for the purpose of assigning a virtual cycle to moduli spaces of pseudoholomorphic curves that cannot be regularized by geometric methods. Their core idea was to build such…

There is a rising need for computational models that can complementarily leverage data of different modalities while investigating associations between subjects for population-based disease analysis. Despite the success of convolutional…

We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram $\mathcal{V}(S)$ (and several variants thereof) of a set $S$ of $n$ sites in the plane as…

The essential graph is a distinguished member of a Markov equivalence class of AMP chain graphs. However, the directed edges in the essential graph are not necessarily strong or invariant, i.e. they may not be shared by every member of the…

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…

We study deformations of affine toric varieties. The entire deformation theory of these singularities is encoded by the so-called versal deformation. The main goal of our paper is to construct the homogeneous part of some degree -R of this,…

This paper overviews work on the use of simple chemical reactions to calculate Voronoi diagrams and undertake other related geometric calculations. This work highlights that this type of specialised chemical processor is a model example of…

Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have…

Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree $d$ plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we…

Updating an abstract Voronoi diagram after deletion of one site in linear time has been a well-known open problem; similarly, for concrete Voronoi diagrams of non-point sites. In this paper, we present an expected linear-time algorithm to…

In low dimensions, conformal anomaly has profound influence on the critical behavior of random surfaces with extrinsic curvature rigidity $1/\a$. We illustrate this by making a small $D$ expansion of rigid random surfaces, where a…

One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor…