Related papers: Degeneracy of Angular Voronoi Diagram
Recent developments on the uniformity of the number of rational points on curves and subvarieties in a moving abelian variety rely on the geometric concept of the degeneracy locus. The first-named author investigated the degeneracy locus in…
We present a paralell approach to discrete geometry: the first one introduces Voronoi cell complexes from statistical tessellations in order to know the mean scalar curvature in term of the mean number of edges of a cell. The second one…
This paper studies generalizations of the concept of acyclic orientations to arc-weighted orientations. These lead to four types of variations of strict degeneracy of graphs. Some of these variations are studied in the literature under…
A hex sphere is a singular Euclidean sphere with four cones points whose cone angles are (integer) multiples of 2*pi/3 but less than 2*pi. Given a hex sphere M, we consider its Voronoi decomposition centered at the two cone points with…
Let $(S,H)$ be a general primitively polarized $K3$ surface of genus $\p$ and let $p_a(nH)$ be the arithmetic genus of $nH.$ We prove the existence in $|\mathcal O_S(nH)|$ of curves with a triple point and $A_k$-singularities. In…
We introduce Veronese-Avoiding hypersurfaces, inspired by the theory of associated forms of Alper--Isaev. In the smooth case, we reinterpret their criterion via Macaulay inverse systems: the Veronese-Avoiding condition is equivalent to the…
We consider a one-dimensional family of rational surfaces with automorphisms. In a degeneration of this family, the limiting map is the identity map on a special fiber. We check that the map on the total space of the family has…
We investigate the combinatorial complexity of geodesic Voronoi diagrams on polyhedral terrains using a probabilistic analysis. Aronov etal [ABT08] prove that, if one makes certain realistic input assumptions on the terrain, this complexity…
In a Lombardi drawing of a graph the vertices are drawn as points and the edges are drawn as circular arcs connecting their respective endpoints. Additionally, all vertices have perfect angular resolution, i.e., all angles incident to a…
Graphs or networks are a very convenient way to represent data with lots of interaction. Recently, Machine Learning on Graph data has gained a lot of traction. In particular, vertex classification and missing edge detection have very…
We characterize plane curve germes non-degenerate in Kouchnirenko's sense in terms of characteristics and intersection multiplicities of branches.
We construct the infinite sequence of invariants for curves in surfaces by using word theory that V. Turaev introduced. For plane closed curves, we add some extra terms, e.g. the rotation number. From these modified invariants, we get the…
We consider the Voronoi tessellation associated to a stationary simple point process on $\mathbb{R}^d$ with finite and positive intensity. We introduce the Delaunay triangulation as its dual graph, i.e.~the graph with vertex set given by…
The Voronoi-based cellular model is highly successful in describing the motion of two-dimensional confluent cell tissues. In the homogeneous version of this model, the energy of each cell is determined solely by its geometric shape and…
Unlike other schemes that locally violate the essential stability properties of the analytic parabolic and elliptic problems, Voronoi finite volume methods (FVM) and boundary conforming Delaunay meshes provide good approximation of the…
We study algorithms and combinatorial complexity bounds for \emph{stable-matching Voronoi diagrams}, where a set, $S$, of $n$ point sites in the plane determines a stable matching between the points in $\mathbb{R}^2$ and the sites in $S$…
In this paper, we construct an algorithm for determining whether a given tessellation on a sphere is a spherical Laguerre Voronoi diagram or not. For spherical Laguerre tessellations, not only the locations of the Voronoi generators, but…
Intrinsic Delaunay triangulation (IDT) is a fundamental data structure in computational geometry and computer graphics. However, except for some theoretical results, such as existence and uniqueness, little progress has been made towards…
A symmetric Venn diagram is one that is invariant under rotation, up to a relabeling of curves. A simple Venn diagram is one in which at most two curves intersect at any point. In this paper we introduce a new property of Venn diagrams…
We present an edge labeling of order-$k$ Voronoi diagrams, $V_k(S)$, of point sets $S$ in the plane, and study properties of the regions defined by them. Among them, we show that $V_k(S)$ has a small orientable cycle and path double cover,…