Counting the number of crossings in geometric graphs

DOI10.1016/j.ipl.2020.106028zbMath1506.68069arXiv1904.11037OpenAlexW3087670905MaRDI QIDQ2224846

Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, César Hernández-Vélez, Frank Duque

Publication date: 4 February 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.11037

zbMATH Keywords

geometric graphsrectilinear crossing numbergraph drawings

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Counting \(k\)-subsets and convex \(k\)-gons in the plane
• Cutting hyperplanes for divide-and-conquer
• A central approach to bound the number of crossings in a generalized configuration
• An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
• Computational search of small point sets with small rectilinear crossing number
• Graph Drawing

This page was built for publication: Counting the number of crossings in geometric graphs