Sciweavers

276 search results - page 26 / 56
» Teaching computer graphics without raster-level algorithms
Sort
View
RT
2000
Springer
15 years 7 months ago
Exact Illumination in Polygonal Environments using Vertex Tracing
Abstract. Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form...
Michael M. Stark, Richard F. Riesenfeld
126
Voted
GECCO
2006
Springer
262views Optimization» more  GECCO 2006»
15 years 7 months ago
Genetically programmed strategies for chess endgame
Classical chess engines exhaustively explore moving possibilities from a chessboard configuration to choose what the next best move to play is. In this article we present a new me...
Nicolas Lassabe, Stéphane Sanchez, Herv&eac...
PC
2010
196views Management» more  PC 2010»
15 years 2 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 9 months ago
Online Occlusion Culling
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Gereon Frahling, Jens Krokowski
SCA
2007
15 years 6 months ago
Guided time warping for motion editing
Time warping allows users to modify timing without affecting poses. It has many applications in animation systems for motion editing, such as refining motions to meet new timing c...
Eugene Hsu, Marco da Silva, Jovan Popovic