2 papers
cs.CG2019
Counting the Number of Crossings in Geometric Graphs
Frank Duque, Ruy Fabila-Monroy, César Hernández-Vélez +1
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n…
math.CO2017
The complexity of computing the cylindrical and the -circle crossing number of a graph
Frank Duque, Hernán González-Aguilar, César Hernández-Vélez +2
A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoint…