Related papers: Degeneracy of Angular Voronoi Diagram
We describe the development of a new software tool, called "Pomelo", for the calculation of Set Voronoi diagrams. Voronoi diagrams are a spatial partition of the space around the particles into separate Voronoi cells, e.g. applicable to…
We study equisingular deformation problems for curves and surfaces in algebraic families, with particular emphasis on situations where nodal behavior is no longer generic. Extending classical Severi theory, we develop deformation--theoretic…
The computation of Voronoi Diagrams, or their dual Delauney triangulations is difficult in high dimensions. In a recent publication Polianskii and Pokorny propose an iterative randomized algorithm facilitating the approximation of Voronoi…
Bernshteyn and Lee defined a new notion, weak degeneracy, which is slightly weaker than the ordinary degeneracy. It is proved that strictly $f$-degenerate transversal is a common generalization of list coloring, $L$-forested-coloring and…
In this paper we initiate the study of tropical Voronoi diagrams. We start out with investigating bisectors of finitely many points with respect to arbitrary polyhedral norms. For this more general scenario we show that bisectors of three…
Globally irreducible nodes (i.e. nodes whose branches belong to the same irreducible component) have mild effects on the most common topological invariants of an algebraic curve. In other words, adding a globally irreducible node (simple…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Mark all vertices on a curve evolving under a family of curves obtained by intersecting a smooth surface M with the 1-parameter family of planes parallel to the tangent plane to M at a point p. Those vertices trace out a set, called the…
We introduce the inverse Voronoi diagram problem in graphs: given a graph $G$ with positive edge-lengths and a collection $\mathbb{U}$ of subsets of vertices of $V(G)$, decide whether $\mathbb{U}$ is a Voronoi diagram in $G$ with respect to…
Navigating topological transitions in cellular mechanical systems is a significant challenge for existing simulation methods. While abstract models lack predictive capabilities at the cellular level, explicit network representations…
We investigate the behaviour of vertices and inflexions on 1-parameter families of curves on smooth surfaces in the 3-space, which include a singular member. In particular, we discuss the context where the curves evolve as sections of a…
We describe limits of line bundles on nodal curves in terms of toric arrangements associated to Voronoi tilings of Euclidean spaces. These tilings encode information on the relationship between the possibly infinitely many limits, and…
The Voronoi Diagram is a geometrical structure that is widely used in scientific or technological applications where proximity is a relevant aspect to consider, and it also resembles natural phenomena such as cellular banks, rock formations…
The analysis of large simple graphs with extreme values of the densities of edges and triangles has been extended to the statistical structure of typical graphs of fixed intermediate densities, by the use of large deviations of Erdoes-Renyi…
We present an expected linear-time algorithm to construct the farthest-segment Voronoi diagram, given the sequence of its faces at infinity. This sequence forms a Davenport-Schinzel sequence of order 3 and it can be computed in O(n log n)…
A Voronoi diagram is a basic geometric structure that partitions the space into regions associated with a given set of sites, such that all points in a region are closer to the corresponding site than to all other sites. While being…
In this paper, we focus on properties of dessins d'enfants associated to trigonal curves. Degtyarev studied dessins d'enfants to compute braid monodromies and fundamental groups of trigonal curves using their combinatorial data. We first…
3D asymmetric tensor fields have found many applications in science and engineering domains, such as fluid dynamics and solid mechanics. 3D asymmetric tensors can have complex eigenvalues, which makes their analysis and visualization more…
Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…
We describe limits of line bundles on nodal curves in terms of toric arrangements associated to Voronoi tilings of Euclidean spaces. These tilings encode information on the relationship between the possibly infinitely many limits, and…