Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
This paper describesthe application of spacetime constraints to creating transitions between segments of human body motion. The motion transition generation uses a combination of ...
Charles Rose, Brian K. Guenter, Bobby Bodenheimer,...
This paper extends the framework of dynamic influence diagrams (DIDs) to the multi-agent setting. DIDs are computational representations of the Partially Observable Markov Decisio...
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
Previous parametric representations of smooth genus-zero surfaces require a collection of abutting patches (e.g. splines, NURBS, recursively subdivided polygons). We introduce a s...
Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe D...