89
Voted
CCCG
2006
15 years 2 months ago
2006
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
75
Voted
CCCG
2006
15 years 2 months ago
2006
We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.
80
Voted
CCCG
2004
15 years 2 months ago
2004
72
Voted
CCCG
2004
15 years 2 months ago
2004
80
Voted
CCCG
2004
15 years 2 months ago
2004
83
Voted
CCCG
2004
15 years 2 months ago
2004
85
Voted
CCCG
2004
15 years 2 months ago
2004
96
Voted
CCCG
2004
15 years 2 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
15 years 2 months ago
2004