We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
The transforming and rendering of discrete objects, such as traditional images (with or without depths) and volumes, can be considered as resampling problem – objects are recons...
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
The initialisation of segmentation methods aiming at the localisation of biological structures in medical imagery is frequently regarded as a given precondition. In practice, howev...
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...