Document
Algorithms; Geometric graphs; Graph drawings; Rectilinear crossing number Geometry; Graph algorithms; Graph theory; Convex geometric graphs; Geometric graphs; Layered graphs; Points in general position; Straight-line segments; Time algorithms; Graph structures
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(n2log⁡n) time algorithm to compute the number of pairs of edges that cross in a geometric graph on n vertices. For layered graphs and convex geometric graphs the algorithm takes O(n2) time. © 2020 Elsevier B.V.
Counting the number of crossings in geometric graphs
Generically Dependent Continuant
RDF description of Counting the number of crossings in geometric graphs - http://orbis.uaslp.mx/vivo/individual/scopus6723
Article
Information Content Entity
Horizon 2020 Framework Programme, H2020: 734922