Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...