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
- Andrea de las Heras-Parrilla
- David Flores‐Peñaloza (ORCID: https://orcid.org/0000-0002-5411-3049)
- Mercè Claverol Aguas (ORCID: https://orcid.org/0000-0002-9138-8594)
- Clemens Huemer (ORCID: https://orcid.org/0000-0001-7557-0823)
- David Orden
Institutions
- Universidad de Alcalá (ES)
- Universidad Nacional Autónoma de México (MX)
- Universitat Politècnica de Catalunya (ES)
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
- Agencia Estatal de Investigación