Sciweavers

39039 search results - page 7651 / 7808
» Implementation of the
Sort
View
TOG
2002
96views more  TOG 2002»
13 years 9 months ago
Robust epsilon visibility
Analytic visibility algorithms, for example methods which compute a subdivided mesh to represent shadows, are notoriously unrobust and hard to use in practice. We present a new me...
Florent Duguet, George Drettakis
TOG
2002
156views more  TOG 2002»
13 years 9 months ago
Chromium: a stream-processing framework for interactive rendering on clusters
We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first a...
Greg Humphreys, Mike Houston, Ren Ng, Randall Fran...
TOG
2002
109views more  TOG 2002»
13 years 9 months ago
Level set surface editing operators
We present a level set framework for implementing editing operators for surfaces. Level set models are deformable implicit surfaces where the deformation of the surface is control...
Ken Museth, David E. Breen, Ross T. Whitaker, Alan...
TON
2002
76views more  TON 2002»
13 years 9 months ago
Some properties of variable length packet shapers
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
Jean-Yves Le Boudec
TON
2002
91views more  TON 2002»
13 years 9 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
« Prev « First page 7651 / 7808 Last » Next »