Counting the Number of Crossings in Geometric Graphs

04/24/2019
by   Frank Duque, et al.
0

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^2 log n) algorithm to compute the number of pairs of edges that cross in a geometric graph on n points. For layered, and convex geometric graphs the algorithm takes O(n^2) time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2021

Disjoint edges in geometric graphs

A geometric graph is a graph drawn in the plane so that its vertices and...
research
01/18/2023

A Note on the k-colored Crossing Ratio of Dense Geometric Graphs

A geometric graph is a graph whose vertex set is a set of points in gene...
research
02/28/2023

On the geometric thickness of 2-degenerate graphs

A graph is 2-degenerate if every subgraph contains a vertex of degree at...
research
08/14/2019

Minimal Representations of Order Types by Geometric Graphs

In order to have a compact visualization of the order type of a given po...
research
08/31/2017

Experimental analysis of the accessibility of drawings with few segments

The visual complexity of a graph drawing is defined as the number of geo...
research
06/29/2022

Generalized Permutants and Graph GENEOs

In this paper we establish a bridge between Topological Data Analysis an...
research
04/27/2021

Communication Costs in a Geometric Communication Network

A communication network is a graph in which each node has only local inf...

Please sign up or login with your details

Forgot password? Click here to reset