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...
In Monte-Carlo photon-tracing methods energy-carrying particles are traced in an environment to generate hit points on object surfaces for simulating global illumination. The surf...
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Unsupervised over-segmentation of an image into superpixels
is a common preprocessing step for image parsing
algorithms. Superpixels are used as both regions of support
for feat...
Alastair P. Moore, Simon J. D. Prince, Jonathan Wa...
Shape correspondence, which aims at accurately identifying corresponding landmarks from a given population of shape instances, is a very challenging step in constructing a statisti...
Pahal Dalal, Lili Ju, Michael McLaughlin, Xiangron...