On polynomials associated to Voronoi diagrams of point sets and crossing numbers

Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with coefficients the numbers of circles through three points of $S$ enclosing $k$ points of $S$, and the $E_{\leq k}$ polynomial with coefficients the numbers of (at most $k$)-edges of $S$. We present several formulas for the rectilinear crossing number of $S$ in terms of these polynomials and their roots. We also prove that the roots of the Voronoi polynomial lie on the unit circle if, and only if, $S$ is in convex position. Further, we present bounds on the location of the roots of these polynomials.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics & Theoretical Computer Science
Published
2024-11-04
DOI
https://doi.org/10.46298/dmtcs.12443
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On polynomials associated to Voronoi diagrams of point sets and crossing numbers

Andrea de las Heras-Parrilla, David Flores‐Peñaloza, Mercè Claverol Aguas, Clemens Huemer et al.
Discrete Mathematics & Theoretical Computer Science
Computational Geometry and Mesh Generation
article

On polynomials associated to Voronoi diagrams of point sets and crossing numbers

Andrea de las Heras-Parrilla, David Flores‐Peñaloza, Mercè Claverol Aguas, Clemens Huemer, David Orden
article en

Abstract

Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with coefficients the numbers of circles through three points of $S$ enclosing $k$ points of $S$, and the $E_{\leq k}$ polynomial with coefficients the numbers of (at most $k$)-edges of $S$. We present several formulas for the rectilinear crossing number of $S$ in terms of these polynomials and their roots. We also prove that the roots of the Voronoi polynomial lie on the unit circle if, and only if, $S$ is in convex position. Further, we present bounds on the location of the roots of these polynomials.

Discrete Mathematics & Theoretical Computer ScienceVol. vol. 26:2(Combinatorics)
Universidad de Alcalá (ES), Universidad Nacional Autónoma de México (MX), Universitat Politècnica de Catalunya (ES)
Agencia Estatal de Investigación
Openalex Percentile: Top 61%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.