525 search results - page 6 / 105 » Bidimensionality and geometric graphs |
DMTCS
2010
13 years 4 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
GD
2004
Springer
14 years 28 days ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
SIBGRAPI
2009
IEEE
14 years 2 months ago
2009
IEEE
Shape discretization through union of weighted points or balls appears as a common representation in different fields of computer graphics and geometric modeling. Among others, it...
JGT
2006
13 years 7 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...