Join Our Newsletter

19 search results - page 1 / 4» On crossing numbers of geometric proximity graphs |

COMGEO

2011

ACM

8 years 2 months ago
2011

ACM

Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...

CCCG

2010

8 years 8 months ago
2010

We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...

ENDM

2008

8 years 7 months ago
2008

We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...

COMPGEOM

2010

ACM

9 years 6 days ago
2010

ACM

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...

GD

2009

Springer

8 years 10 months ago
2009

Springer

We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...