Numerical and Geometric Algorithms and Crowds

Thursday, 3 August
1:45 - 3:30 pm
Hall C
Session Chair: John Snyder, Microsoft Research

Locally Adapted Hierarchical Basis Preconditioning
An adaptive multi-level preconditioner for rapidly solving inhomogeneous first-order interpolation and reconstruction problems that arise in computer graphics and computer vision.

Richard Szeliski
Microsoft Research


Fast Proximity Computation Among Deformable Models Using Discrete Voronoi Diagrams
Novel algorithms to perform collision and distance queries among deformable models in complex environments. This paper demonstrates significant speedups over prior techniques on cloth simulation and breaking-object scenarios.
Implementation Sketch

Avneesh Sud
Naga Govindararju
Russell Gayle
Ilknur Kabul
Dinesh Manocha
University of North Carolina at Chapel Hill


Resolving Surface Collisions Through Intersection Contour Minimization
A simple and easy-to-implement method for resolving intersections between colliding surfaces by inducing relative displacements that minimize the length of intersection contours.

Pascal Volino
Nadia Magnenat-Thalmann
L'Université de Genève


Continuum Crowds
A crowd model based on continuum dynamics rather than agent rules. Our system runs at interactive rates, exhibits smooth flow, and produces emergent phenomena observed in real crowds.

Adrien Treuille
Seth Cooper
University of Washington

Zoran Popović
University of Washington and Electronic Arts