Sciweavers

CCCG
2006
13 years 6 months ago
Computational Euclid
Maarten H. van Emden, Belaid Moa
CCCG
2006
13 years 6 months ago
Routing with Guaranteed Delivery on Virtual Coordinates
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...
Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler
CCCG
2006
13 years 6 months ago
Bounded-Curvature Path Normalization
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.
Jonathan Backer, David G. Kirkpatrick
CCCG
2004
13 years 6 months ago
Tiling layouts with dominoes
Chris Worman, Mark D. Watson
CCCG
2004
13 years 6 months ago
The box mover problem
Valentin Polishchuk
CCCG
2004
13 years 6 months ago
Approximating smallest enclosing disks
Frank Nielsen, Richard Nock
CCCG
2004
13 years 6 months ago
Three-dimensional 1-bend graph drawings
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...
Pat Morin, David R. Wood