35 search results - page 7 / 7 » cccg 2004 |
CCCG
2004
13 years 8 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
CCCG
2004
13 years 8 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
CCCG
2004
13 years 8 months ago
2004
We investigate a question initiated in the work of Sibley and Wagon, who proved that 3 colors suffice to color any collection of 2D parallelograms glued edge-to-edge. Their proof ...
CCCG
2004
13 years 8 months ago
2004
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
CCCG
2004
13 years 8 months ago
2004
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...