We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
In order to compute texture atlases with low stretch and hardly visible texture seams existing texture mapping tools pose high demands on the quality of surface representations li...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Abstract. A new approach to teaching the skills used by health professionals during hands-on (palpation-based) examinations and procedures is reported, where students practice indi...