On the Complexity of Closest Pair via Polar-Pair of Point-Sets

Symposium on Computational Geometry, pp. 28:1-28:15, 2018.

Cited by: 10|Bibtex|Views11|Links
EI

Abstract:

Every graph G can be represented by a collection of equi-radii spheres in a d-dimensional metric M such that there is an edge uv in G if and only if the spheres corresponding to u and v intersect. The smallest integer d such that G can be represented by a collection of spheres (all of the same radius) in M is called the sphericity of G, a...More

Code:

Data:

Your rating :
0

 

Tags
Comments