Sciweavers

16518 search results - page 3052 / 3304
» A New Approach to Splitting-Off
Sort
View
SIGGRAPH
1993
ACM
15 years 10 months ago
Wavelet radiosity
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
Steven J. Gortler, Peter Schröder, Michael F....
SIGGRAPH
1993
ACM
15 years 10 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
SIGGRAPH
1992
ACM
15 years 10 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
159
Voted
CTRS
1990
15 years 10 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
« Prev « First page 3052 / 3304 Last » Next »