For an undirected graph G = (V, E), let Gn denote the graph whose vertex set is V n in which two distinct vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent iff ...
We propose a novel method to reconstruct B-spline surfaces from generalized cylindrical meshes by skinning. Skinning is a well known surface creation technique and has been used i...
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
Background: There is great interest in probing the temporal and spatial patterns of cytosine methylation states in genomes of a variety of organisms. It is hoped that this will sh...
Eyal Gruntman, Yijun Qi, R. Keith Slotkin, Ted Roe...
As multi-core processor systems become more and more widespread, the demand for efficient parallel algorithms also propagates into the field of computer graphics. This is especial...
Bernhard Thomaszewski, Simon Pabst, Wolfgang Bloch...