Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
We propose a method to automatically transform mesh animations into animation collages, i.e. moving assemblies of shape primitives from a database given by an artist. An animation...
Shape information is utilized by numerous applications in computer vision, scientific visualization and computer graphics. This paper presents a novel algorithm for exploring and ...
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
Nathaniel Williams, David P. Luebke, Jonathan D. C...
This paper describes the first version of P (read “P flat”), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms t...