English
Related papers

Related papers: Degeneracy of Angular Voronoi Diagram

200 papers

Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fr\`{e}chet distance. In this…

Computational Geometry · Computer Science 2007-05-23 Sergey Bereg , Marina Gavrilova , Binhai Zhu

In this paper, we review the computational aspects of a multiscale dissipative particle dynamics model for complex fluid simulations based on the feature-rich geometry of the Voronoi tessellation. The geometrical features of the model are…

Soft Condensed Matter · Physics 2009-11-10 G. De Fabritiis , P. V. Coveney

A matching $M$ in a graph $G$ is $r$-degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$-degenerate. Goddard, Hedetniemi, Hedetniemi, and Laskar (Generalized subgraph-restricted matchings in…

Combinatorics · Mathematics 2017-02-09 Julien Baste , Dieter Rautenbach

In the Partial Vertex Cover (PVC) problem, we are given an $n$-vertex graph $G$ and a positive integer $k$, and the objective is to find a vertex subset $S$ of size $k$ maximizing the number of edges with at least one end-point in $S$. This…

Data Structures and Algorithms · Computer Science 2022-01-12 Fahad Panolan , Hannane Yaghoubizade

Given two sets of training samples, general method is to estimate the density function and classify the test sample according to higher values of estimated densities. Natural way to estimate the density should be histogram tending to…

Methodology · Statistics 2017-06-30 Anupam Kundu , Subir Kumar Bhandari

Formulating boundary value problems for multidimensional partial derivative equations in terms of invariant operators of vector (tensor) analysis is convenient. Computational algorithms for approximate solutions are based on constructing…

Numerical Analysis · Mathematics 2024-09-25 Petr N. Vabishchevich

Overlaid oriented Voronoi diagrams (OOVDs) are known to provide useful data for the construction of optimal Euclidean $1$-Steiner trees. The theoretical time complexity of construction methods exploiting the OOVD is $O(n^2)$, but a…

Computational Geometry · Computer Science 2020-02-18 Michael S. Payne , Charl Ras , Marcus Volz

Voronoi Tessellations form an attractive and versatile geometrical asymptotic model for the foamlike cosmic distribution of matter and galaxies. In the Voronoi model the vertices are identified with clusters of galaxies. For a substantial…

Astrophysics · Physics 2007-05-23 Rien van de Weygaert

Many physical systems are composed of polyhedral cells of varying sizes and shapes. These structures are simple in the sense that no more than three faces meet at an edge and no more than four edges meet at a vertex. This means that…

Materials Science · Physics 2022-01-13 Frank H. Lutz , Jeremy K. Mason , Emanuel A. Lazar , Robert D. MacPherson

Deltoid curves appear as consequences of certain procedures in triangle geometry. The best known of these is the construction based on Simson lines, described by Steiner. This is carefully related, in this article, to a less known…

Metric Geometry · Mathematics 2023-07-26 Michael Q. Rieck

For singular corank 1 surfaces in $\mathbb R^3$ we introduce a distinguished normal vector called the axial vector. Using this vector and the curvature parabola we define a new type of curvature called the axial curvature, which generalizes…

Differential Geometry · Mathematics 2019-11-21 Raúl Oset Sinha , Kentaro Saji

We study semistable extremal threefold neighborhoods following earlier work of Mori, Koll\'ar, and Prokhorov. We classify possible flips and extend Mori's algorithm for computing flips of extremal neighborhoods of type k2A to more general…

Algebraic Geometry · Mathematics 2015-07-03 Paul Hacking , Jenia Tevelev , Giancarlo Urzúa

The secant variety of the Veronese surface is a singular cubic fourfold. Degenerations to this specific cubic fourfold and the associated limiting Hodge structures are key ingredients for Hassett and Laza in studying the moduli space of…

Algebraic Geometry · Mathematics 2026-05-26 Renjie Lyu , Zhiwei Zheng

A class of two dimensional conformal field theories is known to correspond to three dimensional Chern-Simons theory. Here we claim that there is an analogous class of four dimensional field theories corresponding to five dimensional…

High Energy Physics - Theory · Physics 2009-10-28 K. S. Gupta , A. Stern

Let $\mathcal S\to\mathbb A^1$ be a smooth family of surfaces whose general fibre is a smooth surface of $\mathbb P^3$ and whose special fibre has two smooth components, intersecting transversally along a smooth curve $R$. We consider the…

Algebraic Geometry · Mathematics 2009-03-20 Concettina Galati

Edges of bands of continuous spectrum of periodic structures arise as maxima and minima of the dispersion relation of their Floquet--Bloch transform. It is often assumed that the extrema generating the band edges are non-degenerate. This…

Spectral Theory · Mathematics 2020-08-26 Gregory Berkolaiko , Minh Kha

We introduce a geometric refinement of Gromov-Witten invariants for $\mathbb P^1$-bundles relative to the natural fiberwise boundary structure. We call these refined invariant correlated Gromov-Witten invariants. Furthermore, we prove a…

Algebraic Geometry · Mathematics 2025-06-19 Thomas Blomme , Francesca Carocci

We consider, under suitable assumptions, the following situation: $\mathcal B$ is a component of the moduli space of polarized surfaces and $\mathcal V_{m,\delta}$ is the universal Severi variety over $\mathcal B$ parametrizing pairs…

Algebraic Geometry · Mathematics 2017-01-26 C. Ciliberto , F. Flamini , C. Galati , A. L. Knutsen

A family of graphs is called degenerate if it contains at least one bipartite graph. In this paper, we investigate the spectral extremal problems for a degenerate family of graphs $\mathcal{F}$. By employing covering and independent…

Combinatorics · Mathematics 2025-07-17 Jiadong Wu , Liying Kang , Zhenyu Ni

A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every 2-degenerate graph can be drawn with straight lines such that the drawing decomposes into 4 plane forests. Therefore, the geometric…

Combinatorics · Mathematics 2023-03-01 Rahul Jain , Marco Ricci , Jonathan Rollin , André Schulz