83
Voted
ISAAC
2000
Springer
15 years 14 days ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
64
Voted
GM
1999
Springer
15 years 1 months ago
1999
Springer
: The idea of summing pairs of so-called semi-wavelets has been found to be very useful for constructing piecewise linear wavelets over refinements of arbitrary triangulations. In...