137
click to vote
ISAAC
2000
Springer
15 years 7 months 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...
136
click to vote
ISAAC
2000
Springer
15 years 7 months ago
2000
Springer
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...
147
click to vote
SIGGRAPH
1998
ACM
15 years 7 months ago
1998
ACM
We introduce ideas, proposed technologies, and initial results for an office of the future that is based on a unified application of computer vision and computer graphics in a sys...
173
click to vote
SIGGRAPH
1998
ACM
15 years 7 months ago
1998
ACM
Global view-dependent illumination phenomena, in particular reflections, greatly enhance the realism of computer-generated imagery. Current interactive rendering methods do not pr...
138
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Executing parallel applications across distributed networks introduces the problem of fault tolerance. A viable solution for fault tolerance must keep overhead manageable and not c...