210
click to vote
COMGEO
15 years 1 months ago
2011 ACM 
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
169
click to vote
COMGEO
15 years 1 months ago
2011 ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
189
click to vote
COMGEO
15 years 1 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...
|
Applied Computing