The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
We describe a linear-time algorithm that recovers absolute camera orientations and positions, along with uncertainty estimates, for networks of terrestrial image nodes spanning hun...
Classical approaches to shape correspondence base their computation purely on the properties, in particular geometric similarity, of the shapes in question. Their performance stil...
Oliver van Kaick, Andrea Tagliasacchi, Oana Sidi, ...
Over the last several years, a new probabilistic representation for 3-d volumetric modeling has been developed. The main purpose of the model is to detect deviations from the norm...